Decoding of Reed Solomon Codes beyond the Error-Correction Bound

This publication has 13 references indexed in Scilit:

• Polynomial factorization 1987–1991
  Published by Springer Nature ,2005
• Learning polynomials with queries: The highly noisy case
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The use of coding theory in computational complexity
  Proceedings of Symposia in Applied Mathematics, 1995
• Highly resilient correctors for polynomials
  Information Processing Letters, 1992
• On the hardness of computing the permanent of random matrices (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1992
• Reconstructing algebraic functions from mixed data
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• The hardness of decoding linear codes with preprocessing
  IEEE Transactions on Information Theory, 1990
• A hard-core predicate for all one-way functions
  Published by Association for Computing Machinery (ACM) ,1989
• Completeness theorems for non-cryptographic fault-tolerant distributed computation
  Published by Association for Computing Machinery (ACM) ,1988
• On the inherent intractability of certain coding problems (Corresp.)
  IEEE Transactions on Information Theory, 1978