A new bound for the data expansion of Huffman codes

DOI10.1109/18.641572zbMath0952.94006OpenAlexW2133208573MaRDI QIDQ4392409

Roberto De Prisco, Alfredo De Santis

Publication date: 5 May 1999

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

Full work available at URL: https://semanticscholar.org/paper/21e2d4eced7beff27ce6f4e07737f39a7e71758c

zbMATH Keywords

Huffman codesmaximum data expansionredundancy of optimal codes

Mathematics Subject Classification ID

Source coding (94A29)

This page was built for publication: A new bound for the data expansion of Huffman codes