On the maximum length of Huffman codes

DOI10.1016/0020-0190(93)90207-PMaRDI QIDQ2366067zbMATH OpenFDO

Authors Michael Buro

Publication date 29 June 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90207-P

zbMATH Keywords

binary Huffman codescode lengthexternal path length

Mathematics Subject Classification ID

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

Recommendations

• Maximal codeword lengths in Huffman codes
• On the redundancy of binary Huffman codes (Corresp.)
• The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
• Minimal Huffman trees
• Tight bounds on the redundancy of Huffman codes

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)

Cited in

(11)

• Maximal codeword lengths in Huffman codes
• Trading off worst and expected cost in decision tree problems
• Huffman codes and maximizing properties of Fibonacci numbers
• Space-efficient Huffman codes revisited
• Optimal prefix codes with fewer distinct codeword lengths are faster to construct
• Parallel lightweight wavelet tree, suffix array and FM-index construction
• Simple bounds on the numbers of binary Huffman sequences
• On the Data Expansion of the Huffman Compression Algorithm
• The length of a typical Huffman codeword
• Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions
• Computing and estimating the number of n-ary Huffman sequences of a specified length

This page was built for publication: On the maximum length of Huffman codes

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