Abstract
We discuss a family of estimators for the entropy rate of a stationary ergodic process and prove their pointwise and mean consistency under a Doeblin-type mixing condition. The estimators are Cesàro averages of longest match-lengths, and their consistency follows from a generalized ergodic theorem due to Maker. We provide examples of their performance on English text, and we generalize our results to countable alphabet processes and to random fields.
Original language | English (US) |
---|---|
Pages (from-to) | 1319-1327 |
Number of pages | 9 |
Journal | IEEE Transactions on Information Theory |
Volume | 44 |
Issue number | 3 |
DOIs | |
State | Published - 1998 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences