Huffman coding with an infinite alphabet

IEEE Transactions on Information Theory

Volumn 42, Issue 3, 1996, Pages 977-984

  Kato, Akiko ^a   Han, Te Sun ^a   Nagaoka, Hiroshi ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Coding of integers; Huffman algorithm; Infinite alphabet; Optimal prefix code; Shannon entropy

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); INFORMATION THEORY; NUMBER THEORY; OPTIMAL SYSTEMS; OPTIMIZATION; PROBABILITY; THEOREM PROVING;

HUFFMAN ALGORITHMS; HUFFMAN CODING; INFINITE ALPHABET; INFORMATION SOURCE; INTEGERS CODING; OPTIMAL PREFIX CODE; OPTIMALITY; SHANNON ENTROPY;

BINARY CODES;

EID: 0030151204     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.490559     Document Type: Article

References (5)

1. J. Abrahams, "Huffman-type codes for infinite source, distributions," J Franklin Inst., vol. 331B, no. 3, pp. 265-271, 1994.
2. R.G. Gallagcr and D. C. Van Voorhis, "Optimal source coding for geometrically distributed integer alphabets." IEEE Trans. Inform. Theory. vol. IT-21, no. 2, pp. 228-230, 1975.
3. D.A. Huffman, "A method for the construction of minimum-redundancy codes," Proc. IRE, vol. 40, no. 10, pp. 1098-1101, 1952.
4. P.A. Humblet, "Optimal source coding for a class of integer alphabets," IEEE Trans. Inform. Theory, vol. IT-24, no. 1, pp. 110-112. 1978.
5. B. Montgomery and J. Abrahams, "On the redundancy of optimal binary prefix-condition codes for finite and infinite sources," IEEE Irans. Inform. Theory, vol. IT 33, no. 1, pp. 156-160, 1987.