Compressing probability distributions
Information Processing Letters
Two recursive versions of the Shannon code
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Compressing probability distributions
Information Processing Letters
Hi-index | 754.84 |
Upper bounds on the redundancy of Huffman codes have been extensively studied in the literature. Almost all of these bounds are in terms of the probability of either the most likely or the least likely source symbol. We prove a simple upper bound in terms of the probability of any source symbol