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展开▼
机译:提供了霍夫曼码冗余的界限,以最可能的来源字母的概率p / sub 1 /表示。特别是,提出的上限比R.G.最近给出的上限更尖锐。 Gallager(同上,IT-24卷,第6期,第668-74页,1978年11月)和R.M. Capocelli等。 (同上,第IT-32卷,第6号,第854-857页,1986年11月),间隔为2 /(2 / sup l + 1 / + 1)> p / sub 1 /> 1 /( 2 / sup 1 / -1),l <或= 2。结果表明,对于这些间隔,新边界是最严格的。
展开▼