A simple upper bound on the redundancy of Huffman codes
From MaRDI portal
Publication:4677534
DOI10.1109/TIT.2002.1013158zbMath1061.94039OpenAlexW2110636207MaRDI QIDQ4677534
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2002.1013158
Related Items (1)
This page was built for publication: A simple upper bound on the redundancy of Huffman codes