Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime

Insertion and deletion (insdel for short) errors are synchronization errors in communication systems caused by the loss of positional information in the message. Reed-Solomon codes have gained a lot of interest due to its encoding simplicity, well structuredness and list-decoding capability in the classical setting. This interest also translates to the insdel metric setting, as the Guruswami-Sudan decoding algorithm can be utilized to provide a deletion correcting algorithm in the insdel metric. Nevertheless, there have been few studies on the insdel error-correcting capability of Reed-Solomon codes. Our main contributions in this paper are explicit constructions of two families of 2-dimensional Reed-Solomon codes with insdel error-correcting capabilities asymptotically reaching those provided by the Singleton bound. The first construction gives a family of Reed-Solomon codes with insdel error-correcting capability asymptotic to its length. The second construction provides a family of Reed Solomon codes with an exact insdel error-correcting capability up to its length. Both our constructions improve the previously known construction of 2-dimensional Reed-Solomon codes whose insdel error-correcting capability is only logarithmic on the code length.

[1]  Bernhard Haeupler,et al.  Synchronization strings: explicit constructions, local decoding, and applications , 2017, STOC.

[2]  Reihaneh Safavi-Naini,et al.  Classification of the Deletion Correcting Capabilities of Reed–Solomon Codes of Dimension $2$ Over Prime Fields , 2007, IEEE Transactions on Information Theory.

[3]  Dongvu Tonien,et al.  Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes , 2007, Des. Codes Cryptogr..

[4]  J. Singer.  A theorem in finite projective geometry and some applications to number theory , 1938 .

[5]  A. Mahmoodi,et al.  Existence of Perfect 3-Deletion-Correcting Codes , 1998, Des. Codes Cryptogr..

[6]  Franz Josef Och,et al.  Minimum Error Rate Training in Statistical Machine Translation , 2003, ACL.

[7]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[8]  Jianxing Yin,et al.  A Combinatorial Construction for Perfect Deletion-Correcting Codes , 2001, Des. Codes Cryptogr..

[9]  Reihaneh Safavi-Naini,et al.  Traitor Tracing for Shortened and Corrupted Fingerprints , 2002, Digital Rights Management Workshop.

[10]  Madhu Sudan,et al.  Maximum-likelihood decoding of Reed-Solomon codes is NP-hard , 1996, IEEE Transactions on Information Theory.

[11]  Gustav Solomon.  Self-synchronizing Reed-Solomon codes (Corresp.) , 1968, IEEE Trans. Inf. Theory.

[12]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[13]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[14]  Kenji Yasunaga,et al.  On the List Decodability of Insertions and Deletions , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[15]  Jehoshua Bruck,et al.  Duplication-correcting codes for data storage in the DNA of living organisms , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[17]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[18]  Patrick A. H. Bours.  On the construction of perfect deletion-correcting codes using design theory , 1995, Des. Codes Cryptogr..

[19]  Venkatesan Guruswami,et al.  Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[20]  Shu Liu,et al.  On List Decoding of Insertion and Deletion Errors , 2019, ArXiv.

[21]  Bernhard Schmidt,et al.  Characters and Cyclotomic Fields in Finite Geometry , 2002 .

[22]  Nabil Shalaby,et al.  Existence of Perfect 4-Deletion-Correcting Codes with Length Six , 2002, Des. Codes Cryptogr..

[23]  Ron M. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.

[24]  Bernhard Schmidt,et al.  Upper Bounds for Cyclotomic Numbers , 2019, 1903.07314.

[25]  Reihaneh Safavi-Naini,et al.  Deletion Correcting Using Generalized Reed-Solomon Codes , 2004 .

[26]  N.J.A. Sloane,et al.  On Single-Deletion-Correcting Codes , 2002, math/0207197.

[27]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[28]  Venkatesan Guruswami,et al.  Optimal Rate List Decoding via Derivative Codes , 2011, APPROX-RANDOM.

[29]  Madhu Sudan,et al.  Synchronization Strings: List Decoding for Insertions and Deletions , 2018, ICALP.

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

[31]  Eric Brill,et al.  An Improved Error Model for Noisy Channel Spelling Correction , 2000, ACL.

[32]  G. Tenengolts,et al.  Nonbinary codes, correcting single deletion or insertion , 1984, IEEE Trans. Inf. Theory.