On Determining Deep Holes of Generalized Reed–Solomon Codes

For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole for generalized Reed-Solomon (GRS) codes is proved to be co-NP-complete by Guruswami and Vardy. For the extended Reed-Solomon codes RSq(Fq, k), a conjecture was made to classify deep holes by Cheng and Murray. Since then efforts have been made to prove the conjecture, or its various forms. In this paper, we classify deep holes completely for GRS codes RSp(D, k), where p is a prime, |D| > k ≥ (p - 1)/2. Our techniques are built on the idea of deep hole trees, and several results concerning the Erdös-Heilbronn conjecture.

[1]  Daqing Wan,et al.  A new sieve for distinct coordinate counting , 2010 .

[2]  Qi Cheng,et al.  On Deciding Deep Holes of Reed-Solomon Codes , 2007, TAMC.

[3]  Qi Cheng,et al.  On the list and bounded distance decodibility of Reed-Solomon codes , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[5]  Guillermo Matera,et al.  Singularities of symmetric hypersurfaces and Reed-Solomon codes , 2012, Adv. Math. Commun..

[6]  Guizhen Zhu,et al.  Computing Error Distance of Reed-Solomon Codes , 2012, TAMC.

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

[8]  Melina Privitelli,et al.  Singularities of symmetric hypersurfaces and an application to Reed-Solomon codes , 2011, 1109.2265.

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

[10]  Venkatesan Guruswami,et al.  Limits to List Decoding Reed–Solomon Codes , 2006, IEEE Transactions on Information Theory.

[11]  Noga Alon,et al.  The Polynomial Method and Restricted Sums of Congruence Classes , 1996 .

[12]  Jorge Castiñeira Moreira,et al.  Reed–Solomon Codes , 2006 .

[13]  J. A. Dias da Silva,et al.  Cyclic Spaces for Grassmann Derivatives and Additive Theory , 1994 .

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

[15]  Ron M. Roth,et al.  On MDS codes via Cauchy matrices , 1989, IEEE Trans. Inf. Theory.

[16]  Luis H. Gallardo,et al.  On a variant of the Erdős-Ginzburg-Ziv problem , 1999 .

[18]  Shaofang Hong,et al.  On deep holes of generalized Reed-Solomon codes , 2012, ArXiv.

[20]  José Felipe Voloch.  Arcs in projective planes over prime fields , 1990 .

[21]  Daqing Wan,et al.  On the subset sum problem over finite fields , 2008, Finite Fields Their Appl..

[22]  Werner Brakemeier.  Eine Anzahlformel von Zahlen modulon , 1978 .

[23]  B. Segre.  Curve razionali normali ek-archi negli spazi finiti , 1955 .

[24]  Shaofang Hong,et al.  On deep holes of standard Reed-Solomon codes , 2011, ArXiv.

[25]  Fang-Wei Fu,et al.  New Deep Holes of Generalized Reed-Solomon Codes , 2012, ArXiv.

[26]  Daqing Wan,et al.  Deep holes in Reed-Solomon codes based on Dickson polynomials , 2016, Finite Fields Their Appl..

[27]  Simeon Ball,et al.  On sets of vectors of a finite vector space in which every subset of basis size is a basis II , 2012, Designs, Codes and Cryptography.