Maximal codeword lengths in Huffman codes

DOI10.1016/S0898-1221(00)00119-XMaRDI QIDQ1570107zbMATH OpenOpenAlexFDO

Authors N. Delaunay

Publication date 9 July 2000

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(00)00119-x

zbMATH Keywords

data compressionFibonacci numberHuffman codinglongest Huffman codeword

Mathematics Subject Classification ID

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

Recommendations

• On the maximum length of Huffman codes
• The length of a typical Huffman codeword
• Tight bounds on the redundancy of Huffman codes
• The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
• On the redundancy of binary Huffman codes (Corresp.)

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Huffman codes and self-information
• Variations on a theme by Huffman

Cited in

(1)

• The length of a typical Huffman codeword

This page was built for publication: Maximal codeword lengths in Huffman codes

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