Optimal Source Coding for a Class of Integer Alphabets

IEEE Transactions on Information Theory

Volumn 24, Issue 1, 1978, Pages 110-112

  Humblet, Pierre A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0017906950     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1978.1055813     Document Type: Article

References (4)

1. D. A. Huffman “A method for the construction of minimum redundancy codes,” in Proc. IRE, vol. 51, pp. 251–252, Sept. 1952.
2. S. W. Golomb “Run length encodings,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 399–401, July 1966.
3. R. G. Gallager and D. C. Van Voorhis “Optimal source codes for geometrically distributed integer alphabets,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 228–230, Mar. 1975.
4. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. I, 3rd Edition. New York: Wiley, 1968.