On lower bounds for the redundancy of optimal codes

DOI10.1023/A:1008273408148zbMath0914.94005OpenAlexW1555278369MaRDI QIDQ1273505

Alfredo De Santis, Roberto De Prisco

Publication date: 27 June 1999

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008273408148

zbMATH Keywords

lower boundsredundancyoptimal codesHuffman codes

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (1)

New bounds on \(D\)-ary optimal codes

This page was built for publication: On lower bounds for the redundancy of optimal codes