On the Data Expansion of the Huffman Compression Algorithm

DOI10.1093/COMJNL/41.3.137MaRDI QIDQ4226630zbMATH OpenOpenAlexFDO

Authors Roberto De Prisco, Alfredo De Santis

Publication date 19 March 2000

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4a622a7b150168410aef56e75cd5a9887a5a5e24

zbMATH Keywords

compression techniquesHuffman encoding

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• A new bound for the data expansion of Huffman codes
• Huffman code efficiencies for extensions of sources
• Maximal codeword lengths in Huffman codes
• On the maximum length of Huffman codes

Cited in

(2)

• Effect of file size, entropy and alphabet size on Huffman algorithm performance
• A new bound for the data expansion of Huffman codes

This page was built for publication: On the Data Expansion of the Huffman Compression Algorithm

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