TY - GEN
T1 - Tight bounds on the redundancy of Huffman codes
AU - Mohajer, Soheil
AU - Pakzad, Payam
AU - Kakhbod, Ali
PY - 2006/11/21
Y1 - 2006/11/21
N2 - In this paper we derive tight upper and lower bounds on the redundancy of the Huffman code on a source, for which the probability of one of the symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound, and we use a simple argument to derive the lower bounds. Several other previously known bounds with different constraints follow immediately from our results.
AB - In this paper we derive tight upper and lower bounds on the redundancy of the Huffman code on a source, for which the probability of one of the symbols is known. We prove a conjecture of Ye and Yeung regarding the upper bound, and we use a simple argument to derive the lower bounds. Several other previously known bounds with different constraints follow immediately from our results.
UR - http://www.scopus.com/inward/record.url?scp=33751039586&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33751039586&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33751039586
SN - 142440035X
SN - 9781424400355
T3 - 2006 IEEE Information Theory Workshop, ITW 2006
SP - 131
EP - 135
BT - 2006 IEEE Information Theory Workshop, ITW 2006
T2 - 2006 IEEE Information Theory Workshop, ITW 2006
Y2 - 13 March 2006 through 17 March 2006
ER -