Journal
IEEE ACCESS
Volume 7, Issue -, Pages 115857-115870Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2932206
Keywords
Huffman code; redundancy; lower bounds
Categories
Funding
- Centre National d'Etudes Spatiales
- Spanish Ministry of Economy and Competitiveness (MINECO)
- European Regional Development Fund (FEDER)
- European Union [TIN2015-71126-R, RTI2018-095287-B-I00]
- Catalan Government [2014SGR-691, 2017SGR-463]
Ask authors/readers for more resources
In this paper, we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known. In particular, we address the case where the occurrence probabilities are unknown for some of the symbols in an alphabet. Bounds can be obtained for alphabets of a given size, for alphabets of up to a given size, and alphabets of arbitrary size. The method operates on a computer algebra system, yielding closed-form numbers for all results. Finally, we show the potential of the proposed method to shed some light on the structure of the minimum redundancy achievable by the Huffman code.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available