• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Decoding Reed Solomon Codes beyond the Error-Correction Bound (1997)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [cr.yp.to]
  • [www.lcs.mit.edu]
  • [www.lcs.mit.edu]
  • [theory.lcs.mit.edu]
  • [theory.lcs.mit.edu]
  • [theory.lcs.mit.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Madhu Sudan
Citations:183 - 16 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Sudan97decodingreed,
    author = {Madhu Sudan},
    title = {Decoding Reed Solomon Codes beyond the Error-Correction Bound },
    year = {1997}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We present a randomized algorithm which takes as input n distinct points f(xi; yi)g n i=1 from F \Theta F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f (xi) for at least t values of i), provided t = \Omega (

Citations

1605 The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1978
574 A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation - Ben-Or, Goldwasser, et al. - 1988
351 Algebraic Coding Theory - Berlekamp - 1968
228 Introduction to Coding Theory - Lint - 1999
212 Some connections between nonuniform and uniform complexity classes - Karp, Lipton - 1980
159 Tilborg. On the inherent intractability of certain coding problems (corresp - Berlekamp, McEliece, et al. - 1978
155 Learning Decision Trees using the Fourier Spectrum - Kushilevitz, Mansour - 1993
96 Error correction of algebraic block codes - Berlekamp, Welch - 1986
76 Learning polynomials with queries: the highly noisy case - Goldreich, Rubinfeld, et al. - 1995
60 Hard-core Predicates for any One-Way Function - Goldreich, Levin - 1989
49 Reconstructing algebraic functions from erroneous data - Ar, Lipton, et al. - 1999
43 Polynomial factorization 1987-1991 - Kaltofen - 1992
40 Highly resilient correctors for polynomials - Gemmell, Sudan - 1992
32 On the hardness of computing the permanent of random matrices - Feige, Lund - 1992
30 Algorithmic Complexity in Coding Theory and the Minimum Distance Problem - Vardy - 1997
28 Bounded distance +1 soft-decision Reed Solomon decoding - Berlekamp - 1996
28 New directions in testing. Distributed Computing and Cryptography - Lipton - 1991
22 The hardness of decoding linear codes with preprocessing - Bruck, Naor - 1990
15 Factorization of polynomials over a finite field and the solution of systems of algebraic equations - Grigoriev
13 A polynomial-time reduction from bivariate to univariate integral polynomial factorization - Kaltofen - 1982
4 Decoding Reed-Solomon codes beyond (d \Gamma 1)=2 errors and zeros of multivariate polynomials. Problems of Information Transmission - Sidelnikov - 1994
3 Two algorithms for the decoding of linear codes - DUMER - 1989
3 Decoding Reed-Solomon codes beyond (d 1)=2 and zeros of multivariate polynomials. Problems of Information Transmission - SIDELNIKOV - 1994
3 The Use of Coding Theory - Feigenbaum - 1995
1 Completeness theorems for non-cryptographic fault-tolerant distributed computation - Manuscript - 1996
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University