Abstract
Erasure entropy rate differs from Shannon's entropy rate in that the conditioning occurs with respect to both the past and the future, as opposed to only the past (or the future). In this paper, consistent universal algorithms for estimating erasure entropy rate are proposed based on the basic and extended context-tree weighting (CTW) algorithms. Simulation results for those algorithms applied to Markov sources, tree sources, and English texts are compared to those obtained by fixed-order plug-in estimators with different orders.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 350-357 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 55 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2009 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Library and Information Sciences
- Computer Science Applications
Keywords
- Bidirectional context tree
- Context-tree weighting
- Data compression
- Entropy rate
- Universal algorithms
- Universal modeling