Entropy of a bit-shift channel
Stan Baggen, Vladimir Balakirsky, Dee Denteneer, Sebastian Egner, Henk Hollmann, Ludo Tolhuizen, Evgeny Verbitskiy
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.
First Page:
Show
Hide
Primary Subjects: 94A17, 28D20
Secondary Subjects: 58F11
Keywords: Markov and hidden Markov processes; entropy; channel capacity; Gibbs vs. non-Gibbs
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.lnms/1196285828
Mathematical Reviews (MathSciNet):
MR2306208
Digital Object Identifier: doi:10.1214/074921706000000293
Institute of Mathematical Statistics Lecture Notes - Monograph Series