Minimal rates of entropy convergence for completely ergodic systems

Israel Journal of Mathematics

Volumn 108, Issue , 1998, Pages 1-12

  Blume, Frank ^a  

^a JOHN BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039346626     PISSN: 00212172     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02783038     Document Type: Article

References (8)

1. P. Arnoux, D. Ornstein and B. Weiss, Cutting and stacking, interval exchanges and geometric models, Israel Journal of Mathematics 50 (1985), 160-168.
2. F. Blume, The Rate of Entropy Convergence, Doctoral Dissertation, University of North Carolina at Chapel Hill, 1995.
3. F. Blume, Possible rates of entropy convergence, Ergodic Theory and Dynamical Systems 17 (1997), 45-70.
4. F. Blume, Minimal rates of entropy convergence for rank one systems, to appear.
5. Karl E. Petersen, Ergodic Theory, Cambridge University Press, New York, 1983.
6. P. Shields, Cutting and stacking: a method for constructing stationary processes, IEEE Transactions on Information Theory 37 (1991), 1605-1617.
7. P. Shields, Universal redundancy rates do not exist, IEEE Transactions on Information Theory 39 (1993), 520-524.
8. P. Shields and B. Weiss, Universal redundancy rates for the class of B-processes do not exist, IEEE Transactions on Information Theory 41 (1997), 508-512.