Computer Science – Information Theory
Scientific paper
2010-12-08
IEEE Transactions on Information Theory, vol. 57, issue 11, pp. 7403-7417, 2011
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory
Scientific paper
10.1109/TIT.2011.2158514
In terabit-density magnetic recording, several bits of data can be replaced by the values of their neighbors in the storage medium. As a result, errors in the medium are dependent on each other and also on the data written. We consider a simple one-dimensional combinatorial model of this medium. In our model, we assume a setting where binary data is sequentially written on the medium and a bit can erroneously change to the immediately preceding value. We derive several properties of codes that correct this type of errors, focusing on bounds on their cardinality. We also define a probabilistic finite-state channel model of the storage medium, and derive lower and upper estimates of its capacity. A lower bound is derived by evaluating the symmetric capacity of the channel, i.e., the maximum transmission rate under the assumption of the uniform input distribution of the channel. An upper bound is found by showing that the original channel is a stochastic degradation of another, related channel model whose capacity we can compute explicitly.
Barg Alexander
Kashyap Navin
Mazumdar Arya
No associations
LandOfFree
Coding for High-Density Recording on a 1-D Granular Magnetic Medium does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Coding for High-Density Recording on a 1-D Granular Magnetic Medium, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coding for High-Density Recording on a 1-D Granular Magnetic Medium will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-76371