Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities
AffiliationUniv Arizona, Dept Elect & Comp Engn
MetadataShow full item record
CitationBlanes, I., Hernández-Cabronero, M., Serra-Sagristà, J., & Marcellin, M. W. (2019). Lower Bounds on the Redundancy of Huffman Codes With Known and Unknown Probabilities. IEEE Access, 7, 115857-115870.
RightsThis work is licensed under a Creative Commons Attribution 4.0 License. For more information, see http://creativecommons.org/licenses/by/4.0/.
Collection InformationThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at email@example.com.
AbstractIn 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.
NoteOpen access journal
VersionFinal published version
SponsorsCentre National d'Etudes Spatiales Centre National D'etudes Spatiales; Spanish Ministry of Economy and Competitiveness (MINECO); European Regional Development Fund (FEDER) European Union (EU); European Union (EU) [TIN2015-71126-R, RTI2018-095287-B-I00]; Catalan Government [2014SGR-691, 2017SGR-463]