The Renyi redundancy of generalized Huffman codes

DOI10.1109/18.21251MaRDI QIDQ3818256zbMATH OpenOpenAlexFDO

Authors Anselm Blumer, Robert J. McEliece

Publication date 1989

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

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

zbMATH Keywords

average codeword length, Huffman's algorithmGallager's bound on the redundancy of Huffman codesnoiseless source coding theoremoptimal codesShannon's entropy

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Source coding (94A29) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Tight bounds on the redundancy of Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• On the redundancy achieved by Huffman codes
• Bounds on the redundancy of Huffman codes (Corresp.)
• scientific article; zbMATH DE number 41961

Cited in

(12)

• The relation between information theory and the differential geometry approach to statistics
• Huffman algebras for independent random variables
• Minimax trees in linear time with applications
• Cramér-Rao lower bounds arising from generalized Csiszár divergences
• Asymptotic average redundancy of Huffman (and other) block codes
• scientific article; zbMATH DE number 2086237 (Why is no real title available?)
• On the competitive optimality of Huffman codes
• scientific article; zbMATH DE number 4210045 (Why is no real title available?)
• Relative uniformity of sources and the comparison of optimal code costs
• Redundancy-Related Bounds for Generalized Huffman Codes
• Bernstein polynomials and learning theory
• Rényi divergence in hidden Markov models

This page was built for publication: The Renyi redundancy of generalized Huffman codes

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