Existence of optimal prefix codes for infinite source alphabets

IEEE Transactions on Information Theory

Volumn 43, Issue 6, 1997, Pages 2026-2028

  Linder, Tamás ^a,b,c   Tarokh, Vahid ^a,d   Zeger, Kenneth ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Huffman; Lossless coding; Prefix codes

Indexed keywords

ENCODING (SYMBOLS); INFORMATION THEORY; OPTIMIZATION; RANDOM PROCESSES;

HUFFMAN CODES; PREFIX CODES;

CODES (SYMBOLS);

EID: 0031271475     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.641571     Document Type: Article

References (8)

1. T. Cover and J. Thomas, Elements of Information Theory. New York: Wiley, 1991.
2. D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, pp. 1098-1101, Oct. 1952.
3. J. Abrahams, "Huffman-type codes for infinite source distributions," J. Franklin Inst., vol. 331B, no. 3, pp. 265-271, 1994.
4. R. A. Gallager and D. C. Van Voorhis, "Optimal source coding for geometrically distributed integer alphabets," IEEE Trans. Inform. Theory, vol. IT-21, pp. 228-230, Mar. 1975.
5. P. A. Humblet, "Optimal source coding for a class of integer alphabets," IEEE Trans. Inform. Theory, vol. IT-24, pp. 110-112, Jan. 1978.
6. B. Montgomery and J. Abrahams, "On the redundancy of optimal binary prefix-condition codes for finite and infinite sources," IEEE Trans. Inform. Theory, vol. IT-33, pp. 156-160, Jan. 1987.
7. A. Kato, T. S. Han, and H. Nagaoka, "Huffman coding with infinite alphabet," IEEE Trans. Inform. Theory, vol. 42, pp. 977-984, May 1996.
8. W. Rudin, Principles of Mathematical Analysis, 3rd ed. New York: McGraw-Hill, 1976.