Entropy of a bit-shift channel

DOI10.1214/074921706000000293MaRDI QIDQ5307919zbMATH OpenOpenAlexFDO

Authors Stan Baggen, Dee Denteneer, Sebastian Egner, Henk D. L. Hollmann, L. M. G. M. Tolhuizen, Evgeny Verbitskiy, V. B. Balakirskij

Publication date 19 September 2007

Full work available at URL https://arxiv.org/abs/math/0608254

zbMATH Keywords

\(g\)-measuresbit-shift channelchannel capacityGibbs vs. non-Gibbshidden Markov processRLL-sequences

Mathematics Subject Classification ID

Entropy and other invariants (28D20) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05)

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.

Recommendations

• Entropy of some binary sources
• Entropy of a stationary process and entropy of a shift transformation in its sample space
• scientific article; zbMATH DE number 3139241
• Epsilon Entropy and Data Compression
• On the Entropy Rate of Pattern Processes

Cited in

(5)

• Entropy of some binary sources
• Shannon entropy rate of hidden Markov processes
• Asymptotics of input-constrained binary symmetric channel capacity
• scientific article; zbMATH DE number 4002029 (Why is no real title available?)
• scientific article; zbMATH DE number 5208524 (Why is no real title available?)

This page was built for publication: Entropy of a bit-shift channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307919)