Abstract
We determine the entropy rate of patterns of certain random processes including all finite-entropy stationary processes. For independent and identically distributed (i.i.d.) processes, we also bound the speed at which the per-symbol pattern entropy converges to this rate, and show that patterns satisfy an asymptotic equipartition property. To derive some of these results we upper bound the probability that the nth variable in a random process differs from all preceding ones. copy; 2006 IEEE.
Original language | English (US) |
---|---|
Pages (from-to) | 2954-2964 |
Number of pages | 11 |
Journal | IEEE Transactions on Information Theory |
Volume | 52 |
Issue number | 7 |
DOIs | |
State | Published - Jul 2006 |
Externally published | Yes |
Keywords
- Asymptotic equipartition property
- Entropy rate
- Large alphabets
- Patterns
- Universal compression
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences