An ergodic theorem for constrained sequences of functions
HTML articles powered by AMS MathViewer
- by John C. Kieffer PDF
- Bull. Amer. Math. Soc. 21 (1989), 249-254
References
-
1. R. Blahut, Principles and practice of information theory, Addison-Wesley, Reading, Mass., 1987.
- Leo Breiman, The individual ergodic theorem of information theory, Ann. Math. Statist. 28 (1957), 809–811. MR 92710, DOI 10.1214/aoms/1177706899 3. I. Csiszár, J. Körner, L. Lovász, K. Marton, and G. Simonyi, Entropy splitting for antiblocking pairs and perfect graphs (submitted).
- J. F. C. Kingman, The ergodic theory of subadditive stochastic processes, J. Roy. Statist. Soc. Ser. B 30 (1968), 499–510. MR 254907, DOI 10.1111/j.2517-6161.1968.tb00749.x
- Donald Ornstein and Benjamin Weiss, The Shannon-McMillan-Breiman theorem for a class of amenable groups, Israel J. Math. 44 (1983), no. 1, 53–60. MR 693654, DOI 10.1007/BF02763171
- Paul C. Shields, The ergodic and entropy theorems revisited, IEEE Trans. Inform. Theory 33 (1987), no. 2, 263–266. MR 880168, DOI 10.1109/TIT.1987.1057287
Additional Information
- Journal: Bull. Amer. Math. Soc. 21 (1989), 249-254
- MSC (1985): Primary 28D99; Secondary 60G10, 94A15
- DOI: https://doi.org/10.1090/S0273-0979-1989-15821-7
- MathSciNet review: 998629