Pick ~x (1)
Abstract:
Sudan and others have considered the problem of reconstructing a bounded-degree polynomial f: F k
Citations
| 148 | Decoding of Reed-Solomon codes beyond the error-correction bound – Sudan - 1997 |
| 89 | Error correction of algebraic block codes – Berlekamp, Welch |
| 67 | Learning polynomials with queries: The highly noisy case – Goldreich, Rubinfeld, et al. - 2000 |
| 56 | Reconstructing algebraic functions from mixed data – Ar, Lipton, et al. - 1999 |
| 46 | Polynomial factorization 1987-1991 – KALTOFEN - 1992 |
| 38 | Highly resilient correctors for polynomials – Gemmell, Sudan - 1992 |
| 14 | Decoding algebraic-geometric codes beyond the error-correction bound – SHOKROLLAHI, WASSERMAN - 1998 |
| 12 | Maximum likelihood decoding of Reed Solomon codes – Sudan - 1996 |
