New bounds on the redundancy of Huffman codes

DOI10.1109/18.87001zbMath0733.94009OpenAlexW4255350051MaRDI QIDQ3360786

Alfredo De Santis, Renato M. Capocelli

Publication date: 1991

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

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

zbMATH Keywords

redundancyUpper and lower boundsmemoryless sourcebinary Huffman codes

Mathematics Subject Classification ID

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

Related Items (4)

A fast algorithm for adaptive prefix coding ⋮ On the redundancy achieved by Huffman codes ⋮ Is Huffmann coding dead? ⋮ Optimal binary search trees

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