The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
Some connections between nonuniform and uniform complexity classes
Karp, R. M., & Lipton, R. J. (1980) · Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80 · doi:10.1145/800141.804678 · Cited by 577
Lipton, R. (1991) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/002/13 · Cited by 255
Highly resilient correctors for polynomials
Gemmell, P., & Sudan, M. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90195-2 · Cited by 169
Self-citationLearning polynomials with queries: The highly noisy case
Goldreich, O., Rubinfeld, R., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492485 · Cited by 167
Self-citationLearning decision trees using the Fourier spectrum
Kushilevitz, E., & Mansour, Y. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103466 · Cited by 139
The hardness of decoding linear codes with preprocessing
Bruck, J., & Naor, M. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.52484 · Cited by 106
On the hardness of computing the permanent of random matrices
Feige, U., & Lund, C. (1996) · Computational Complexity · doi:10.1007/bf01262928 · Cited by 53
On the hardness of computing the permanent of random matrices (extended abstract)
Feige, U., & Lund, C. (1992) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/129712.129775 · Cited by 18
Cited by
Juels, A., & Wattenberg, M. (1999) · Proceedings of the 6th ACM conference on Computer and communications security · doi:10.1145/319709.319714 · Cited by 1,591
Improved decoding of Reed-Solomon and algebraic-geometry codes
Guruswami, V., & Sudan, M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782097 · Cited by 998
Self-citationRevealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Oblivious transfer and polynomial evaluation
Naor, M., & Pinkas, B. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301312 · Cited by 629
Metadata
- Authors
- Sudan, M.
- Venue
- Journal of Complexity
- Publisher
- Elsevier BV
- Published
- 1997-03
- Volume
- 13
- Issue
- 1
- Pages
- 180-193
- ISSN
- 0885-064X (ISSN-L)
- OpenAlex
- W2089272132
- Cited by
- 723
- References
- 12
- FWCI
- 17.59
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.