Optimal Source Codes for Geometrically Distributed Integer Alphabets

IEEE Transactions on Information Theory

Volumn 21, Issue 2, 1975, Pages 228-230

  Gallager, Robert G ^a   Van Voorhis, David C ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (4)

1. D. A. Huffman, “A method for the construction of minimum-redundancy codes,” Proc. IRE, vol. 40, pp. 1098-1191, Sept. 1952.
2. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968, ch. 3.
3. S. W. Golomb, “Run length encodings,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 399–401, July 1966.
4. D. C. Van Voorhis, “Constructing codes with ordered codeword lengths,” IBM Syst. Development Div., Los Gatos, Calif., Working Paper 16/A45 No. 2, Jan. 1974.