期刊
IEEE ACCESS
卷 7, 期 -, 页码 115857-115870出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2932206
关键词
Huffman code; redundancy; lower bounds
资金
- 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]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据