Bounds on the redundancy of Huffman codes

Authors:
R M Capocelli;R Giancarlo;I J Taneja
Affiliations:
-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
1986

Citing 0
Cited 5

Data compression

ACM Computing Surveys (CSUR)
On Lower Bounds for the Redundancy of Optimal Codes

Designs, Codes and Cryptography
An efficient variable length coding scheme for an IID source

DCC '95 Proceedings of the Conference on Data Compression
Boosting textual compression in optimal linear time

Journal of the ACM (JACM)
Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching

Quantified Score

Hi-index	754.84

Visualization

Abstract

New upper bounds on the redundancy of Huffman codes are provided. A bound that for2/9 leq P_{1} leq 0.4is sharper than the bound of Gallager, when the probability of the most likely source letterP_{1}is the only known probability is presented. The improved bound is the tightest possible for1/3 leq P_{1} leq 0.4. Upper bounds are presented on the redundancy of Huffman codes when the extreme probabilitiesP_{1}andP_{N}are known.