On deep holes of generalized Reed-Solomon codes
arXiv:1205.7016 · doi:10.3934/Math.2016.2.96
Abstract
Determining deep holes is an important topic in decoding Reed-Solomon codes. In a previous paper [8], we showed that the received word is a deep hole of the standard Reed-Solomon codes if its Lagrange interpolation polynomial is the sum of monomial of degree and a polynomial of degree at most . In this paper, we extend this result by giving a new class of deep holes of the generalized Reed-Solomon codes.
arXiv comment5 pages
References in corpus (1)
Cited by in corpus (5)
- On error distance of received words with fixed degrees to Reed-Solomon code
- Deep Holes in Reed-Solomon Codes Based on Dickson Polynomials
- On Determining Deep Holes of Generalized Reed-Solomon Codes
- On deep holes of generalized projective Reed-Solomon codes
- On planes through points off the twisted cubic in and multiple covering codes