On the competitive optimality of Huffman codes

DOI10.1109/18.61133MaRDI QIDQ3197749zbMATH OpenOpenAlexFDO

Authors Thomas M. Cover

Publication date 1991

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

Full work available at URL https://semanticscholar.org/paper/fa178e7d920189b14afa27a90be969fe7fd5927a

zbMATH Keywords

competitive optimalitydata compressionoptimality of Huffman codesShannon codes

Mathematics Subject Classification ID

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

Recommendations

• A note on the competitive optimality of the Huffman code
• Competitive optimality of source codes
• The Renyi redundancy of generalized Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• Existence of optimal prefix codes for infinite source alphabets

Cited in

(9)

• A note on the competitive optimality of the Huffman code
• An application of the Hopfield model to Huffman codes
• The length of a typical Huffman codeword
• Average-sense optimality and competitive optimality for almost instantaneous VF codes
• scientific article; zbMATH DE number 1848287 (Why is no real title available?)
• scientific article; zbMATH DE number 826041 (Why is no real title available?)
• Competitive optimality of source codes
• First come first served for online slot allocation and Huffman coding
• Is Huffmann coding dead?

This page was built for publication: On the competitive optimality of Huffman codes

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