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)

zbMATH Keywords

code lengthexternal path lengthbinary Huffman codes

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

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

Cited in

(9)

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

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)