Huffman codes and self-information

DOI10.1109/TIT.1976.1055554MaRDI QIDQ4111466zbMATH OpenOpenAlexFDO

Authors Tibor O. H. Nemetz, Gyula O. H. Katona

Publication date 1976

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1976.1055554

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(11)

• Compressed depth sequences
• On the redundancy achieved by Huffman codes
• Maximal codeword lengths in Huffman codes
• An efficient decoding technique for Huffman codes
• Minimax trees in linear time with applications
• Space-efficient Huffman codes revisited
• Optimal binary search trees
• Algorithmic information and simplicity in statistical physics
• Huffman coding with non-sorted frequencies
• Simple worst-case optimal adaptive prefix-free coding
• Dynamic Shannon coding

This page was built for publication: Huffman codes and self-information

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