Block Source Coding Theory for Asymptotically Mean Stationary Sources

IEEE Transactions on Information Theory

Volumn 30, Issue 1, 1984, Pages 54-68

  Gray, Robert A ^a   Saadat, Farivar ^b  

^a STANFORD UNIVERSITY   (United States)

^b NONE   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (34)

1. R. M. Gray and J. C. Kieffer, “Asymptotically mean stationary measures,” Ann. Prob., vol. 8, pp. 962–973, 1980.
2. C. E. Shannon, “Coding theorems for a discrete source with a fidelity,” IRE Nat’L Rec., Part 4, pp. 142–163, 1959.
3. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
4. T. Berger, Rate Distortion Theory. Englewood Cliffs, NJ: Prentice-Hall, 1971.
5. J. C. Oxtoby, “Ergodic sets,” Bull. Amer. Math. Soc., vol. 58, pp. 116–136, 1952.
6. D. S. Ornstein “An application of ergodic theory to probability theory,” Ann. Prob., vol. 1, pp. 43–58, 1973.
7. R. M. Gray and L. D. Davisson, “The ergodic decomposition of stationary discrete random processes,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 625–636, Sept. 1974.
8. R. L. Dobrushin, “General formulation of Shannon’s basic theory of information,” Usp. Mat. Nauk., vol. 14, pp. 3-104, 1959. (Trans.: Amer. Math. Soc. Translations, Series 2, vol. 33, pp. 323-438.)
9. M. S. Pinsker, Information and Information Stability of Random Variables. Moscow: Akad. Nauk., SSSR 1960. (A. Feinstein, Transl., Holden-Day: San Francisco, CA, 1964.)
10. R. M. Gray and J. C. Kieffer, “ Mutual information rate, distortion, and quantization in metric spaces,” IEEE Trans. Inform. Theory, vol. IT-26, pp. 412–422, July 1980.
11. A. Perez, “Extensions of Shannon-McMillan’s limit theorem to more general stochastic processes,” Third Prague Conf. on Inform. Theory, Statist. Decision Functions and Radon Processes. Prague: Publ. House Czech. Akad. Sci., and New York: Academic, 1964, pp. 545–574.
12. J. C. Kieffer, “A counterexample to Perez’s generalization of the Shannon-McMillan theorem,” Ann. Prob., vol. 1, pp. 362–364, 1973.
13. J. Dunham, “A note on the abstract block source coding with a fidelity criterion theorem,” IEEE Trans. Inform. Theory, vol. IT-24, p. 760, Nov. 1978.
14. M. S. Pinsker, “Sources of messages,” Prob. Peredach. Inform., vol. 14, pp. 5–20, 1963.
15. D. L. Neuhoff and P. C. Shields, “Channels with almost finite memory,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 440–447, July 1979.
16. K. Marton, “ On the rate distortion function of stationary sources,” Probl. Contr. Inform. Theory, vol. 4, pp. 289–297, 1979.
17. R. M. Gray, D. L. Neuhoff, and J. K. Omura, “Process definitions of distortion-rate functions and source coding theorems,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 524–532, Sept. 1975.
18. T. Hashimoto, “A direct proof of the process definition of the distortion-rate function for stationary ergodic sources,” Inform. Contr., vol. 51, pp. 45–57, 1983.
19. K. R. Parthasarathy, Probability Measures on Metric Spaces. New York: Academic, 1967.
20. R. B. Ash, Real Analysis and Probability. New York: Academic, 1972.
21. R. J. Fontana, R. M. Gray, and J. C. Kieffer, “Asymptotically mean stationary channels,” IEEE Trans. Inform. Theoty, vol. IT-27, pp. 308–316, May 1981.
22. R. M. Gray, D. S. Ornstein, and R. L. Dobrushin, “Block synchronization, sliding-block coding, invulnerable sources and zero error codes for discrete noisy channels,” Ann. Prob., vol. 8, pp. 639–674, 1980.
23. P. C. Shields and D. L. Neuhoff, “Block and sliding-block source coding,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 211–215, Mar. 1977.
24. R. M. Gray and D. S. Ornstein “Shding-block joint source/noisy-channel coding theorems,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 682–690, Nov. 1976.
25. P. C. Shields, “Stationary coding of processes,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 283–291, May 1979.
26. R. L. Adler, “Ergodic and mixing properties,” Proc. Amer. Math. Soc., vol. 12, pp. 924–930, Dec. 1961.
27. J. R. Brown, Ergodic Theory and Topological Dynamics. New York: Academic, 1976.
28. R. M. Gray and L. D. Davisson, “Source coding theorems without the ergodic assumption,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 502–516, July 1974.
29. J. C. Kieffer, “On the optimum average distortion attainable by fixed-rate coding of a nonergodic source,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 190–193, Mar. 1975.
30. J. C. Kieffer, “A generalization of the Pursley-Davisson-Mackenthum universal variable-rate source coding theorem,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 694–697, Nov. 1977.
31. R. M. Gray, D. L. Neuhoff, and D. S. Ornstein, “Nonblock source coding with a fidelity criterion,” Ann. Prob., vol. 3, pp. 478–491, 1975.
32. R. M. Gray, “Sliding block source coding,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 357–368, July 1975.
33. A. D. Wyner, “A definition of conditional mutual information for arbitrary ensembles,” Inform. Contr., vol. 38, pp. 51–-59 1978.
34. P. Billingsley, Ergodic Theory and Information. New York: Wiley, 1965.