Abstract
We consider a simple transformation (coding) of an iid source called a bit-shift channel. This simple transformation occurs naturally in magnetic or optical data storage. The resulting process is not Markov of any order. We discuss methods of computing the entropy of the transformed process, and study some of its properties.
Original language | English |
---|---|
Title of host publication | EPRINTS-BOOK-TITLE |
Publisher | University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science |
Number of pages | 12 |
Publication status | Published - 2006 |
Keywords
- Gibbs vs. non-Gibbs
- channel capacity
- Entropy
- Markov and hidden Markov processes