On the redundancy of optimal codes with limited word length

DOI10.1109/18.119701zbMath0743.94021OpenAlexW2058342272MaRDI QIDQ3990781

Alfredo De Santis, Renato M. Capocelli

Publication date: 28 June 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.119701

zbMATH Keywords

optimal codesbounds on the redundancylimited codeword lengthredundancy of \(D\)-ary codesunconstrained Huffman codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

This page was built for publication: On the redundancy of optimal codes with limited word length