Back to Search
Start Over
On deep holes of generalized Reed-Solomon codes
- Source :
- AIMS Mathematics 1 (2016), 96-101
- Publication Year :
- 2012
-
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.<br />Comment: 5 pages
- Subjects :
- Mathematics - Number Theory
Computer Science - Information Theory
Subjects
Details
- Database :
- arXiv
- Journal :
- AIMS Mathematics 1 (2016), 96-101
- Publication Type :
- Report
- Accession number :
- edsarx.1205.7016
- Document Type :
- Working Paper
- Full Text :
- https://doi.org/10.3934/Math.2016.2.96