The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Roth, R. (2006) · doi:10.1017/cbo9780511808968 · Cited by 912
A method for finding codewords of small weight
Stern, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0019850 · Cited by 464
Cited by
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Becker, A., Joux, A., May, A., & Meurer, A. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_31 · Cited by 398
Self-citationAnalysis of Information Set Decoding for a Sub-linear Error Weight
Canto Torres, R., & Sendrier, N. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-29360-8_10 · Cited by 85
Structural cryptanalysis of McEliece schemes with compact keys
Faugère, J.-C., Otmani, A., Perret, L., de Portzamparc, F., & Tillich, J.-P. (2016) · Designs, Codes and Cryptography · doi:10.1007/s10623-015-0036-z · Cited by 49
On the dimension and structure of the square of the dual of a Goppa code
Mora, R., & Tillich, J.-P. (2023) · Designs, Codes and Cryptography · doi:10.1007/s10623-022-01153-w · Cited by 18
Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes
Bardet, M., Mora, R., & Tillich, J.-P. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3334592 · Cited by 15
Metadata
- Authors
- May, A., Meurer, A., & Thomae, E.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 107-124
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W31442624
- Cited by
- 215
- References
- 3
- FWCI
- 9.80
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$. https://app.cochat.ai/papers/10.1007/978-3-642-25385-0_6
- The paper
- May, A., Meurer, A., & Thomae, E. (2011). Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-25385-0_6
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.