Bounds on the redundancy of Huffman codes (Corresp.)

DOI10.1109/TIT.1986.1057239MaRDI QIDQ3752292zbMATH OpenOpenAlexFDO

Authors Renato M. Capocelli, Inder J. Taneja, R. Giancarlo

Publication date 1986

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

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

zbMATH Keywords

upper bounds

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Tight upper bounds on the redundancy of Huffman codes
• New bounds on the redundancy of Huffman codes
• Tight bounds on the redundancy of Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• A note on D-ary Huffman codes

Cited in

(11)

• The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
• Is Huffmann coding dead?
• The Renyi redundancy of generalized Huffman codes
• A lower-bound for the maximin redundancy in pattern coding
• Redundancy-Related Bounds for Generalized Huffman Codes
• A note on D-ary Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• scientific article; zbMATH DE number 4210045 (Why is no real title available?)
• On the redundancy achieved by Huffman codes
• A simple upper bound on the redundancy of Huffman codes
• Tight upper bounds on the redundancy of Huffman codes

This page was built for publication: Bounds on the redundancy of Huffman codes (Corresp.)

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