Huffman codes and self-information
From MaRDI portal
Publication:4111466
DOI10.1109/TIT.1976.1055554zbMath0343.94014OpenAlexW2043628395MaRDI QIDQ4111466
Gyula O. H. Katona, Tibor O. H. Nemetz
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
Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items
Dynamic Shannon coding ⋮ On the redundancy achieved by Huffman codes ⋮ Algorithmic information and simplicity in statistical physics ⋮ Huffman coding with non-sorted frequencies ⋮ Minimax trees in linear time with applications ⋮ Optimal binary search trees ⋮ Compressed depth sequences ⋮ Maximal codeword lengths in Huffman codes ⋮ Space-efficient Huffman codes revisited ⋮ An efficient decoding technique for Huffman codes
