A note on the competitive optimality of the Huffman code

DOI10.1109/18.119700MaRDI QIDQ3990780zbMATH OpenOpenAlexFDO

Authors Meir Feder

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.119700

zbMATH Keywords

Chebyshev inequalitycompetitive optimalityHuffman codeself informationShannon- Fano code

Mathematics Subject Classification ID

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

Recommendations

• On the competitive optimality of Huffman codes
• Competitive optimality of source codes
• On the redundancy of binary Huffman codes (Corresp.)
• Tight bounds on the redundancy of Huffman codes

Cited in

(4)

• On the competitive optimality of Huffman codes
• An application of the Hopfield model to Huffman codes
• Competitive optimality of source codes
• Is Huffmann coding dead?

This page was built for publication: A note on the competitive optimality of the Huffman code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990780)