Abstract
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.
Original language | English (US) |
---|---|
Article number | 8782526 |
Pages (from-to) | 115857-115870 |
Number of pages | 14 |
Journal | IEEE Access |
Volume | 7 |
DOIs | |
State | Published - 2019 |
Externally published | Yes |
Keywords
- Huffman code
- lower bounds
- redundancy
ASJC Scopus subject areas
- General Computer Science
- General Materials Science
- General Engineering