Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity

Volumn 13, Issue 1, 1997, Pages 180-193

  Sudan, Madhu ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031097176     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1997.0439     Document Type: Article

References (18)

1. S. Ar, R. Lipton, R. Rubinfeld, M. Sudan, 1992, Reconstructing algebraic functions from mixed data, Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, 503, 512.
2. S. Arora, M. Sudan, Aug. 1996.
3. M. Ben-Or, S. Goldwasser, A. Wigderson, 1988, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, 1, 10.
4. E. Berlekamp, L. Welch, 1986, Error Correction of Algebraic Block Codes.
5. Berlekamp E., McEliece R., Van Tilborg H. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory. 1978;384-386.
6. Bruck J., Naor M. The hardness of decoding linear codes with preprocessing. IEEE Trans. Inform. Theory. 1990;381-385.
7. U. Feige, C. Lund, 1992, On the hardness of computing the permanent of random matrices, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, 643, 654.
8. J. Feigenbaum, 1995, The use of coding theory in computational complexity, Proceedings of Symposia in Applied Mathematics, 203, 229, American Math Society, Providence, RI.
9. Gemmell P., Sudan M. Highly resilient correctors for polynomials. Inform. Process. Lett. 43:1992;169-174.
10. O. Goldreich, L. A. Levin, 1989, A hard-core predicate for any one-way function, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, 25, 32.
11. O. Goldreich, R. Rubinfeld, M. Sudan, 1995, Learning polynomials with queries: The highly noisy case (extended abstract), Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, 294, 303.
12. R. Impagliazzo, N. Nisan, Sept. 1996.
13. E. Kaltofen, 1992, Polynomial factorization 1987-1991, LATIN '92, I. Simon, Lecture Notes in Computer Science, 585, 294, 313, Springer-Verlag, New York/Berlin.
14. R. Karp, R. Lipton, 1980, Some connections between nonuniform and uniform complexity classes, Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 302, 309.
15. E. Kushilevitz, Y. Mansour, 1991, Learning decision trees using the Fourier spectrum, Proceedings of the 23th Annual ACM Symposium on Theory of Computing, 1991, 455, 464.
16. Lipton R. New directions in testing. DIMACS Series in Discrete Math. and Theoretical Computer Science. 2:1991.
17. MacWilliams F., Sloane N. The Theory of Error-Correcting Codes. 1981;North-Holland, Amsterdam.
18. Van Lint J. H. Introduction to Coding Theory. 1982;Springer-Verlag, New York/Berlin.