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.
Information
Published: 1 January 2006
First available in Project Euclid: 28 November 2007
zbMATH: 1137.94005
MathSciNet: MR2306208
Digital Object Identifier: 10.1214/074921706000000293
Subjects:
Primary:
28D20
,
94A17
Secondary:
58F11
Keywords:
channel capacity
,
Entropy
,
Gibbs vs. non-Gibbs
,
Markov and hidden Markov processes
Rights: Copyright © 2006, Institute of Mathematical Statistics