On deep holes of generalized Reed-Solomon codes
Abstract
Determining deep holes is an important topic in decoding Reed-Solomon codes. In a previous paper [8], we showed that the received word u is a deep hole of the standard Reed-Solomon codes [q-1, k]q if its Lagrange interpolation polynomial is the sum of monomial of degree q-2 and a polynomial of degree at most k-1. In this paper, we extend this result by giving a new class of deep holes of the generalized Reed-Solomon codes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.