Entropy and recurrence rates for stationary random fields

IEEE Transactions on Information Theory

Volumn 48, Issue 6, 2002, Pages 1694-1697

  Ornstein, Donald ^a   Weiss, Benjamin ^b  

^a STANFORD UNIVERSITY   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Countable alphabet; Entropy; Random fields; Recurrence times; Shannon McMillan Breiman (SMB) theorem

Indexed keywords

ENTROPY; PROBABILITY; STATE SPACE METHODS; THEOREM PROVING;

RANDOM FIELDS; RECURRENCE RATES;

RANDOM PROCESSES;

EID: 0036612006     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.1003848     Document Type: Article

References (10)

1. A note on the ergodic theorem of information theory
2. Nonparametric entropy estimation for stationary processes and random fields, with applications to English text
3. Pointwise theorems for amenable groups
4. The Shannon-mcmillan-breiman theorem for a class of amenable groups
5. How sampling reveals a process
6. Entropy and data compression schemes
7. An entropy estimator for a class of infinite alphabet processes
8. The interactions between ergodic theory and information theory
9. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
10. On the role of pattern matching in information theory