Bounding the Average Length of Optimal Source Codes Via Majorization Theory

DOI10.1109/TIT.2004.825026MaRDI QIDQ3546721zbMATH OpenFDO

Authors Ferdinando Cicalese, Ugo Vaccaro

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
• Relative uniformity of sources and the comparison of optimal code costs
• Tight bounds on the redundancy of Huffman codes
• On the average codeword length of optimal binary codes for extended sources (Corresp.)
• scientific article; zbMATH DE number 3932941

Cited in

(4)

• New bounds on \(D\)-ary optimal codes
• scientific article; zbMATH DE number 6683480 (Why is no real title available?)
• The Minimum Average Code for Finite Memoryless Monotone Sources
• scientific article; zbMATH DE number 3932941 (Why is no real title available?)

This page was built for publication: Bounding the Average Length of Optimal Source Codes Via Majorization Theory

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