Codes Correcting Limited-Shift Errors in Racetrack Memories

In this work, we study limited-shift errors in racetrack memories and propose several schemes to combat these errors. There are two kinds of shift errors, namely under-shift errors, that can be modeled as sticky-insertions and limited-over-shift errors, that can be modeled as bursts of deletions of limited length. One approach to tackle the problem is to use deletion/sticky-insertion-correcting codes. Using this approach, we present a new family of asymptotically optimal codes that correct multiple bursts of deletions of limited length and any number of sticky insertions. We then study another approach that takes advantage of the special features of racetrack memories and the ability to add extra heads for redundancy. Here, we propose how to place the extra heads and construct codes to correct these shift errors.

[1]  V. Guruswami,et al.  Efficient low-redundancy codes for correcting multiple deletions , 2016, SODA 2016.

[2]  Eitan Yaakobi,et al.  Codes Correcting a Burst of Deletions or Insertions , 2016, IEEE Transactions on Information Theory.

[3]  Eitan Yaakobi,et al.  Coding for racetrack memories , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[4]  Bernhard Haeupler,et al.  Synchronization strings: codes for insertions and deletions approaching the Singleton bound , 2017, STOC.

[5]  Eitan Yaakobi,et al.  Codes correcting position errors in racetrack memories , 2017, 2017 IEEE Information Theory Workshop (ITW).

[6]  Paul H. Siegel,et al.  Constructions and Decoding of Cyclic Codes Over $b$ -Symbol Read Channels , 2016, IEEE Transactions on Information Theory.

[7]  S. Parkin,et al.  Magnetic Domain-Wall Racetrack Memory , 2008, Science.

[8]  Alexander Vardy,et al.  Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[9]  Salim El Rouayheb,et al.  Correcting bursty and localized deletions using guess & check codes , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Yeow Meng Chee,et al.  Maximum Distance Separable Codes for Symbol-Pair Read Channels , 2012, IEEE Transactions on Information Theory.

[11]  W. Marsden.  I and J , 2012 .

[12]  H. C. Ferreira,et al.  On multiple insertion/deletion correcting codes , 1994, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[13]  Khaled A. S. Abdel-Ghaffar,et al.  Codes for correcting three or more adjacent deletions or insertions , 2014, 2014 IEEE International Symposium on Information Theory.

[14]  Kenneth G. Paterson,et al.  A method for constructing decodable de Bruijn sequences , 1996, IEEE Trans. Inf. Theory.

[15]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[16]  Lara Dolecek,et al.  Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods , 2009, SIAM J. Discret. Math..

[17]  Yeow Meng Chee,et al.  Permutation codes correcting a single burst deletion II: Stable deletions , 2015, 2017 IEEE International Symposium on Information Theory (ISIT).

[18]  Yeow Meng Chee,et al.  Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[19]  A. Robert Calderbank,et al.  Correcting Two Deletions and Insertions in Racetrack Memory , 2017, ArXiv.

[20]  Mario Blaum,et al.  Codes for Symbol-Pair Read Channels , 2010, IEEE Transactions on Information Theory.