Tight upper bounds on the redundancy of Huffman codes

DOI10.1109/18.42226zbMath0683.94014OpenAlexW2103424467MaRDI QIDQ4733830

Alfredo De Santis, Renato M. Capocelli

Publication date: 1989

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

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

zbMATH Keywords

redundancy of Huffman codes

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

On the redundancy achieved by Huffman codes

This page was built for publication: Tight upper bounds on the redundancy of Huffman codes