A Large Deviation Theory Proof of the Abstract Alphabet Source Coding Theorem

IEEE Transactions on Information Theory

Volumn 34, Issue 5, 1988, Pages 1081-1083

  Bucklew, J A ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

ABSTRACT ALPHABET SOURCE CODING; FIDELITY CRITERION THEOREM; LARGE DEVIATION THEORY; RATE DISTORTION THEORY; SOURCE CODING;

CODES, SYMBOLIC;

EID: 0024078652     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.21237     Document Type: Article

References (9)

1. T. Berger, Rate Distortion Theory, A Mathematical Basis for Data Compression. Englewood Cliffs, NJ: Prentice-Hall, 1971.
2. A. Perez, “Extensions of Shannon-McMillan's limit theorem to more general stochastic processes,” in Trans. 3rd Prague Conf. Information Theory, Statistical Decision Functions, and Random Processes. Prague, Czech.: Publ. House Czech. Acad. Sci., and New York: Academic, pp. 545–574.
3. J. Dunham, “A note on the abstract-alphabet block source coding with a fidelity criterion theorem,” IEEE Trans. Inform. Theory, vol. IT-24, no. 6, p. 760, Nov. 1978.
4. J. Kieffer, “A counterexample to Perez's generalization of the Shannon-McMillan theorem,” Ann. Prob., vol. 1, no. 2, pp. 362–364, 1973.
5. —, “Correction to “A counterexample of Perez's generalization of the Shannon-McMillan theorem,’” Ann. Prob., vol. 4, no. 1, pp. 153–154, 1976.
6. M. S. Pinsker, “Sources of messages,” Probl. Peredach. Inform., vol. 14, pp. 5–20, 1963 (in Russian).
7. J. A. Bucklew, “The source coding theorem via Sanov's theorem,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 907-909, Nov. 1987.
8. J. Gartner, “On large deviations from the invariant measure,” Theory Probl. Appl., vol. 22, pp. 24–39.
9. R. S. Ellis, “Large deviations for a general class of random vectors,” Ann. Prob., vol. 12, no. 1, pp. 1–12, 1984.