Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes

Details Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes

2007-06-23

arxiv.org/abs/0706.3480v1

Computer Science

Information Theory

9 pages, 2 figures

Scientific paper

In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. The Fibonacci distributions are introduced which play a fundamental role in AUH codes. It is shown that such distributions maximize the average length and the entropy of the code for a given alphabet size. Another previously known bound on the entropy for given average length follows immediately from our results.

Affiliated with

Also associated with

No associations

Rating

Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight Bounds on the Average Length, Entropy, and Redundancy of Anti-Uniform Huffman Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703963