论文信息 - Huffman-type codes for infinite source distributions

Huffman-type codes for infinite source distributions

A new sufficient condition is given for an infinite source distribution to share a minimum average codeword length code with a geometric distribution. Thus some new examples of parametric families of infinite source distributions can be optimally encoded by Huffman-type codes.<<ETX>>

Julia Abrahams

[1] Pierre A. Humblet,et al. Optimal source coding for a class of integer alphabets (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[2] David C. van Voorhis,et al. Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[3] S. Golomb. Run-length encodings. , 1966 .

[4] Yi-Ching Yao,et al. On optimal nested group testing algorithms , 1990 .

[5] Frank K. Hwang,et al. On Finding a Single Defective in Binomial Group Testing , 1974 .

[6] Refael Hassin. A Dichotomous Search for a Geometric Random Variable , 1984, Oper. Res..

[7] Padhraic Smyth,et al. A High-Speed Distortionless Predictive Image-Compression Scheme , 1990 .

[8] Solomon W. Golomb,et al. Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.