Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
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
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008