Bounds and constructions for granular media coding

Bounds on the rate of grain-correcting codes are presented. The lower bounds are Gilbert-Varshamov-like ones, whereas the upper bounds improve on the previously known result by Mazumdar et al‥ Constructions of t-grain-correcting codes of length n for certain values of n and t are discussed.

[1]  M. Tsfasman,et al.  Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[2]  Selim Tuncel,et al.  Classification Problems in Ergodic Theory , 1982 .

[3]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[4]  B. Harshbarger.  An Introduction to Probability Theory and its Applications, Volume I , 1958 .

[5]  Brian H. Marcus,et al.  Improved Gilbert-Varshamov bound for constrained systems , 1992, IEEE Trans. Inf. Theory.

[6]  A. Kavcic,et al.  The Feasibility of Magnetic Recording at 10 Terabits Per Square Inch on Conventional Media , 2009, IEEE Transactions on Magnetics.

[7]  Navin Kashyap,et al.  Upper bounds on the size of grain-correcting codes , 2013, 2013 IEEE International Symposium on Information Theory.

[8]  Byoung-Seon Choi,et al.  Conditional limit theorems under Markov conditioning , 1987, IEEE Trans. Inf. Theory.

[9]  A. J. Han Vinck,et al.  A coding scheme for single peak-shift correction in (d, k)-constrained channels , 1993, IEEE Trans. Inf. Theory.

[10]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[11]  Ludo M. G. M. Tolhuizen,et al.  The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction] , 1997, IEEE Trans. Inf. Theory.

[12]  David W. Lewis,et al.  Matrix theory , 1991 .

[13]  Shlomo Shamai,et al.  Bounds on the capacity of the bit-shift magnetic recording channel , 1991, IEEE Trans. Inf. Theory.

[14]  Khaled A. S. Abdel-Ghaffar,et al.  Bounds and constructions for runlength-limited error-control block codes , 1991, IEEE Trans. Inf. Theory.

[15]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[16]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[17]  Paul H. Siegel,et al.  Write Channel Model for Bit-Patterned Media Recording , 2010, IEEE Transactions on Magnetics.

[18]  Navin Kashyap,et al.  Coding for high-density magnetic recording , 2010, 2010 IEEE International Symposium on Information Theory.

[19]  Anxiao Jiang,et al.  Patterned cells for phase change memories , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[20]  Victor D. Kolesnik,et al.  Generating functions and lower bounds on rates for limited error-correcting codes , 1991, IEEE Trans. Inf. Theory.

[21]  Navin Kashyap,et al.  Coding for High-Density Recording on a 1-D Granular Magnetic Medium , 2010, IEEE Transactions on Information Theory.

[22]  B. Marcus.  Constrained Systems and Coding for Recording Channels, in Handbook of Coding Theory, v. Finite-state Modulation Codes for Data Storage, Ieee , 2000 .

[23]  Victor D. Kolesnik,et al.  Lower bounds on achievable rates for limited bitshift correcting codes , 1994, IEEE Trans. Inf. Theory.

[24]  Hiroaki Muraoka,et al.  Shingled Magnetic Recording on Bit Patterned Media , 2010, IEEE Transactions on Magnetics.

[25]  Wan H. Kim,et al.  Single error-correcting codes for asymmetric binary channels , 1959, IRE Trans. Inf. Theory.