Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }

DOI10.1109/TIT.2012.2208580zbMath1364.94680arXivcs/0508039OpenAlexW2066846147MaRDI QIDQ2989692

Ali Kakhbod, Payam Pakzad, Soheil Mohajer

Publication date: 8 June 2017

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

Full work available at URL: https://arxiv.org/abs/cs/0508039

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (1)

On the redundancy of \(D\)-ary Fano codes

This page was built for publication: Tight Bounds on the Redundancy of Huffman Codes\hbox{ H }\hbox{ H }