Answers are grounded in this paper and cite their sources.
Bounds on the redundancy of Huffman codes in terms of the probability p/sub 1/ of the most likely source letter are provided. In particular, upper bounds are presented that are sharper than the bounds given recently by R.G. Gallager (ibid., vol.IT-24, no.6, p.668-74, Nov.1978) and by R.M. Capocelli et al. (ibid., vol. IT-32, no.6, p.854-857, Nov. 1986) for an interval 2/(2/sup l+1/+1)<p/sub 1/<1/(2/sup l/-1), l>or=2. It is shown that the new bounds are the tightest possible for these intervals.<<ETX>>
No takes yet. Share an insight, caveat, or question.
Capocelli et al. (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: