The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
On Deciding Deep Holes of Reed-Solomon Codes
[article]
2005
arXiv
pre-print
For generalized Reed-Solomon codes, it has been proved GuruswamiVa05 that the problem of determining if a received word is a deep hole is co-NP-complete. The reduction relies on the fact that the evaluation set of the code can be exponential in the length of the code -- a property that practical codes do not usually possess. In this paper, we first presented a much simpler proof of the same result. We then consider the problem for standard Reed-Solomon codes, i.e. the evaluation set consists of
arXiv:cs/0509065v1
fatcat:lxaciygbsncwhizrc4kphm6ogy