Loading...
research article
Tight Bounds on the Redundancy of Huffman Codes
Mohajer, Soheil
•
Pakzad, Payam
•
Kakhbod, Ali
In this paper, we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound on the redundancy of such Huffman codes, which yields in a tight upper bound. We also derive a tight lower bound for the redundancy under the same assumption. We further apply the method introduced in this paper to other related problems. It is shown that several other previously known bounds with different constraints follow immediately from our results.
Type
research article
Web of Science ID
WOS:000310156500004
Authors
Mohajer, Soheil
•
Pakzad, Payam
•
Kakhbod, Ali
Publication date
2012
Published in
Volume
58
Issue
11
Start page
6737
End page
6746
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 27, 2013
Use this identifier to reference this record