Papers
Topics
Authors
Recent
Search
2000 character limit reached

New Deep Holes of Generalized Reed-Solomon Codes

Published 30 May 2012 in cs.IT, math.IT, and math.NT | (1205.6593v1)

Abstract: Deep holes play an important role in the decoding of generalized Reed-Solomon codes. Recently, Wu and Hong \cite{WH} 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 \cite{WH}. Li and Wan \cite{L.W1} studied deep holes of generalized Reed-Solomon codes $GRS_{k}(\f,D)$ and characterized deep holes defined by polynomials of degree $k+1$. They showed that this problem is reduced to be a subset sum problem in finite fields. Using the method of Li and Wan, we obtain some new deep holes for special Reed-Solomon codes over finite fields with even characteristic. Furthermore, we study deep holes of the extended Reed-Solomon code, i.e., $D=\f$ and show polynomials of degree $k+2$ can not define deep holes.

Citations (11)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.