Loading...
conference paper
Tight bounds on the AUH codes
Mohajer, Soheil
•
Kakhbod, Ali
2008
2008 42Nd Annual Conference On Information Sciences And Systems
In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper hounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. Also an upper bound on the entropy of AUH codes is also presented in terms of the average cost of the code. 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.
Type
conference paper
Web of Science ID
WOS:000258931600183
Authors
Mohajer, Soheil
•
Kakhbod, Ali
Publication date
2008
Published in
2008 42Nd Annual Conference On Information Sciences And Systems
Start page
1010
End page
1014
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Princeton, NJ | Mar 19-21, 2008 | |
Available on Infoscience
November 30, 2010
Use this identifier to reference this record