Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
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
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002