Bounds on the redundancy of Huffman codes (Corresp.)

DOI10.1109/TIT.1986.1057239zbMath0611.94006OpenAlexW2147680448MaRDI QIDQ3752292

Renato M. Capocelli, Inder Jeet Taneja, Raffaele Giancarlo

Publication date: 1986

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

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

zbMATH Keywords

upper bounds

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (2)

On the redundancy achieved by Huffman codes ⋮ Is Huffmann coding dead?

This page was built for publication: Bounds on the redundancy of Huffman codes (Corresp.)