• Corpus ID: 15154257

New Deep Holes of Generalized Reed-Solomon Codes

  title={New Deep Holes of Generalized Reed-Solomon Codes},
  author={Jun Zhang and Fangwei Fu and Qunying Liao},
Deep holes play an important role in the decoding of generalized Reed-Solomon codes. Recently, Wu and Hong [11] found a new class of deep holes for standard Reed-Solomon codes. In the present paper, we give a concise method to obtain a new class of deep holes for generalized Reed-Solomon codes. In particular, for standard Reed-Solomon codes, we get the new class of deep holes given in [11]. Li and Wan [6] studied deep holes of generalized Reed-Solomon codes GRSk(Fq,D) and characterized deep… 

On Determining Deep Holes of Generalized Reed–Solomon Codes

This paper classify deep holes completely for GRS codes RSp(D, k), where p is a prime, |D| > k ≥ (p - 1)/2, and is built on the idea of deep hole trees, and several results concerning the Erdös-Heilbronn conjecture.

Explicit Deep Holes of Reed-Solomon Codes

In this paper, deep holes of Reed-Solomon (RS) codes are studied. A new class of deep holes for generalized affine RS codes is given if the evaluation set satisfies certain combinatorial structure.

Deep holes in Reed-Solomon codes based on Dickson polynomials

Finite Geometry and Deep Holes of Reed-Solomon Codes over Finite Local Rings

This paper proposes the maximum arc problem, normal rational curve conjecture, and extensions of normal rational curves over finite local rings, analogously to the finite geometry over finite fields, and studies the deep hole problem of generalized Reed-Solomon codes over finiteLocal rings.

Improved error bounds for the distance distribution of Reed-Solomon codes

The generating function approach is used to derive simple expressions for the factorial moments of the distance distribution over Reed-Solomon codes, leading to new results on the classification of deep holes of Reed Solomon codes.

On deep-holes of Gabidulin codes

On Deep Holes of Elliptic Curve Codes

A method to construct deep holes for elliptic curve codes and it is conjecture that this construction is complete in the sense that it gives all deep holes.

Deep Holes of Projective Reed-Solomon Codes

This paper uses algebraic methods to explicitly construct three classes of deep holes for PRS codes with redundancy four, and shows that these three classes completely classify all deep holes of PRS code with redundancyFour.

On deep holes of projective Reed-Solomon codes

  • Jun ZhangD. Wan
  • Computer Science
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
New results on the covering radius and deep holes for projective Reed-Solomon (PRS) codes are obtained.



On deep holes of standard Reed-Solomon codes

This paper finds a new class of deep holes for standard Reed-Solomon codes [q − 1, k]q with q a power of the prime p and shows that the received word u is a deep hole if its Lagrange interpolation polynomial is the sum of monomial of degree q − 2 and a polynometric of degree at most k − 1.

On Deciding Deep Holes of Reed-Solomon Codes

By applying Cafure-Matera estimation of rational points on algebraic varieties, it is proved that the received vector (f(α))α∈Fp for the Reed-Solomon, cannot be a deep hole, whenever f(x) is a polynomial of degree k + d for 1 ≤ d ≤ p3/13-Ɛ.

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract)

These results show that the decoding problems for the Reed-Solomon code are at least as hard as the discrete logarithm problem over finite fields.

Reed–Solomon Codes

A Reed-Solomon (RS) code is an error-correcting code first described in a paper by Reed and Solomon in 1960 [9]. Since that time they’ve been applied in CD-ROMs, wireless communications, space

On error distance of Reed-Solomon codes

A significant improvement is given of the recent bound of Cheng-Murray on non-existence of deep holes (words with maximal error distance) using the Weil bound for character sum estimate.

On the list and bounded distance decodibility of Reed-Solomon codes

  • Qi ChengD. Wan
  • Computer Science
    45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
This paper proves that list decoding can not be done for radius n - g(n, k: q) or larger, otherwise the discrete logarithm over F/sub qg(m, k, q)-k/ is easy, and shows that the discretelogarithM problem over F-sub qh/ can be efficiently reduced by a randomized algorithm to the bounded distance decoding problem of the Reed-Solomon code.

Decoding of Reed Solomon Codes beyond the Error-Correction Bound

To the best of the knowledge, this is the first efficient (i.e., polynomial time bounded) algorithm which provides error recovery capability beyond the error-correction bound of a code for any efficient code.

Maximum-likelihood decoding of Reed-Solomon codes is NP-hard

  • M. Sudan
  • Computer Science
    IEEE Transactions on Information Theory
  • 2005
It is proved that maximum-likelihood decoding is NP-hard for the family of Reed-Solomon codes, thereby strengthening a result of Bruck and Naor.

On the subset sum problem over finite fields

  • Jiyou LiD. Wan
  • Computer Science, Mathematics
    Finite Fields Their Appl.
  • 2008

Singularities of symmetric hypersurfaces and an application to Reed-Solomon codes

We determine conditions on q for the nonexistence of deep holes of the standard Reed-Solomon code of dimension k over F_q generated by polynomials of degree k+d. Our conditions rely on the existence