Ergodicity of Markov Channels

IEEE Transactions on Information Theory

Volumn 33, Issue 5, 1987, Pages 656-664

  Gray, Robert M ^a   Dunham, Mari O ^b   Gobbi, R L ^c  

^a STANFORD UNIVERSITY   (United States)

^b BOSTON UNIVERSITY   (United States)

^c LOCKHEED MARTIN SPACE SYSTEMS COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY;

ASYMPTOTICALLY MEAN STATIONARY CHANNEL; MARKOV CHANNELS ERGODICITY; NONHOMOGENEOUS MARKOV CHAINS; WEAKLY ERGODIC MARKOV CHANNELS;

INFORMATION THEORY;

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

References (19)

1. R.L. Adler, “Ergodic and mixing properties of infinite memory channels,” Proc. Amer. Math. Soc., 12, pp. 924–930, 1960.
2. D, Blackwell, L. Breiman, and A. Thomasian, “Proof of Shannon's transmission theorem for finitestate indecomposable channels,” Ann. Math. Statist., vol. 18, pp. 1209–1220, 1958.
3. M.O. Dunham and R.M. Gray, “An algorithm for the design of labeled-transition finitestate vector quantizers,” IEEE Trans. Commun., COM-33, pp. 83–89, 1985.
4. H. Furstenberg and H. Kesten, “Products of random matrices,” Ann. Math. Statist., vol. 31, pp. 457–469, 1960.
5. R.G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
6. R.M. Gray and J.C. Kieffer, “Asymptotically mean stationary measures,” Ann. Prob., 8, pp. 962–973, 1980.
7. J. Hajnal, “Weak ergodicity in nonhomogeneous Markov chains,” Proc. Cambridge Philos. Soc., 54, pp. 233–246, 1958.
8. Y. Katznelson and B. Weiss, “A simple proof of some ergodic theorems,” Israel Journ. Math., 42, pp. 291–296, 1982.
9. J.C. Kieffer and M. Rahe, “Markov channels are asymptotically mean stationary,” Siam J. Math. Anal., 12, pp. 293–305, 1981.
10. J.F.C. Kingman, “Geometrical aspects of the theory of nonhomogeneous Markov chains,” Math. Proc. Camb. Phil. Soc., 77, pp. 171–183, 1975.
11. J.F.C. Kingman, “Subadditive ergodic theory,” Ann. Prob., 1, pp. 883–909, 1973.
12. A. Paz, Stochastic Automata Theory. New York: Academic, 1971.
13. E. Pfaffelhuber, “Channels with asymptotically decreasing memory and anticipation,” IEEE Trans. Inform. Theory, 17, pp. 379–385, 1971.
14. C.E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., 27, pp. 379-423, 623–656, 1948.
15. D.H. Shi and F. Kozin, “On almost sure convergence of adaptive algorithms,” preprint.
16. A. Viterbi and J. Omura, Principals of Digital Communication and Coding. New York: McGraw-Hill, 1979.
17. J. Wolfowitz, “Products of indecomposable, aperiodic, stochastic matrices,” Proc. Amer. Math. Soc., vol. 14, pp. 733–737, 1963.
18. K. Nawrotzki, “Discrete open systems for Markov chains in a random environment I,” Elektron. Informationsverarb. Kybernet., vol. 17, pp. 569–599, 1981.
19. R. Cogburn, “On products of random stochastic matrices and their applications,” Contemporary Mathematics, vol. 50, pp. 199–213, 1984.