The length of a typical Huffman codeword
From MaRDI portal
Publication:4324194
DOI10.1109/18.335944zbMath0811.94026arXivadap-org/9303001OpenAlexW2101215830MaRDI QIDQ4324194
Publication date: 1 March 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/adap-org/9303001
Related Items
Algorithmic information and simplicity in statistical physics ⋮ An efficient decoding technique for Huffman codes
This page was built for publication: The length of a typical Huffman codeword