The Renyi redundancy of generalized Huffman codes
From MaRDI portal
Publication:3818256
DOI10.1109/18.21251zbMath0665.94026OpenAlexW2156745536MaRDI QIDQ3818256
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
Shannon's entropyoptimal codesaverage codeword length, Huffman's algorithmGallager's bound on the redundancy of Huffman codesnoiseless source coding theorem
Measures of information, entropy (94A17) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29)
Related Items (3)
The relation between information theory and the differential geometry approach to statistics ⋮ Minimax trees in linear time with applications ⋮ Cramér-Rao lower bounds arising from generalized Csiszár divergences
This page was built for publication: The Renyi redundancy of generalized Huffman codes
