Abstract
For generalized Reed-Solomon codes, it has been proved [7] 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 present 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 all the nonzero elements in the field. We reduce the problem of identifying deep holes to deciding whether an absolutely irreducible hypersurface over a finite field contains a rational point whose coordinates are pairwise distinct and nonzero. By applying Cafure-Matera estimation of rational points on algebraic varieties, we prove that the received vector (f(α))_α ∈ F p for the Reed-Solomon [p − 1,k] p , k < p 1/4 − ε, cannot be a deep hole, whenever f(x) is a polynomial of degree k + d for 1 ≤ d < p 3/13 − ε.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berlekamp, E., Welch, L.: Error correction of algebraic block codes. U.S. Patent Number 4633470 (1986)
Cafure, A., Matera, G.: Improved explicit estimates on the number of solutions of equations over a finite field (2004), http://www.arxiv.org/abs/math.NT/0405302
Cheng, Q., Wan, D.: On the list and bounded distance decodibility of the Reed-Solomon codes (extended abstract). In: Proc. 45th IEEE Symp. on Foundations of Comp. Science, FOCS, pp. 335–341 (2004)
Cohen, S.D.: Explicit theorems on generator polynomials. Finite Fields and Their Applications. To appear (2005)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Transactions on Information Theory 45(6), 1757–1767 (1999)
Guruswami, V., Vardy, A.: Maximum-likelihood decoding of Reed-Solomon codes is NP-hard. In: Proceeding of SODA (2005)
Schmidt, W.: Equations over Finite Fields. An Elementary Approach. Lecture Notes in Mathematics, vol. 536. Springer, Heidelberg (1976)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, Q., Murray, E. (2007). On Deciding Deep Holes of Reed-Solomon Codes. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)