On the maximum length of Huffman codes

DOI10.1016/0020-0190(93)90207-PzbMath0769.94007MaRDI QIDQ2366067

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)

Related Items (4)

Parallel lightweight wavelet tree, suffix array and FM-index construction ⋮ Trading off worst and expected cost in decision tree problems ⋮ Optimal prefix codes with fewer distinct codeword lengths are faster to construct ⋮ Space-efficient Huffman codes revisited

Cites Work

• A Method for the Construction of Minimum-Redundancy Codes
• Unnamed Item

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