Raymond Wu, Jie Lu
ITA Conference 2007
Bounds on the redundancy of Huffman codes, in terms of the probability p1, of the most likely source letter, are provided. In particular, upper bounds are presented that are sharper than the recent bounds given by Gallager and by Capocelli et al., for an interval 2/(2l+1 +1) < p1 < 1/(2l -1), l ≥ 2. It is also shown that the new bounds are the tightest possible for these intervals. © 1989 IEEE
Raymond Wu, Jie Lu
ITA Conference 2007
Hendrik F. Hamann
InterPACK 2013
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989