The DOI matches its Crossref record.
On the inherent intractability of certain coding problems (Corresp.)
Open accessAbstract
The fact that the general decoding problem for linear codes and the general problem of finding the weights of a linear code are both NP-complete is shown. This strongly suggests, but does not rigorously imply, that no algorithm for either of these problems which runs in polynomial time exists.
Overview
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
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Black holes as mirrors: quantum information in random subsystems
Hayden, P., & Preskill, J. (2007) · Journal of High Energy Physics · doi:10.1088/1126-6708/2007/09/120 · Cited by 1,332
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2020) · IEEE Access · doi:10.1109/access.2020.2968985 · Cited by 607
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
A method for finding codewords of small weight
Stern, J. (2006) · Lecture Notes in Computer Science · doi:10.1007/bfb0019850 · Cited by 464
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes
Misoczki, R., Tillich, J.-P., Sendrier, N., & Barreto, P. S. L. M. (2013) · 2013 IEEE International Symposium on Information Theory · doi:10.1109/isit.2013.6620590 · Cited by 420
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
Codes for the quantum erasure channel
Grassl, M., Beth, T., & Pellizzari, T. (1997) · Physical Review A · doi:10.1103/physreva.56.33 · Cited by 374
Status report on the third round of the NIST Post-Quantum Cryptography Standardization process
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., et al. (2022) · doi:10.6028/nist.ir.8413-upd1 · Cited by 301
Quantum computation vs. firewalls
Harlow, D., & Hayden, P. (2013) · Journal of High Energy Physics · doi:10.1007/jhep06(2013)085 · Cited by 310
Efficient Encryption From Random Quasi-Cyclic Codes
Aguilar-Melchor, C., Blazy, O., Deneuville, J.-C., Gaborit, P., & Zemor, G. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2804444 · Cited by 122
A distinguisher for high rate McEliece cryptosystems
Faugere, J.-C., Gauthier-Umana, V., Otmani, A., Perret, L., & Tillich, J.-P. (2011) · 2011 IEEE Information Theory Workshop · doi:10.1109/itw.2011.6089437 · Cited by 108
Optimal and efficient decoding of concatenated quantum block codes
Poulin, D. (2006) · Physical Review A · doi:10.1103/physreva.74.052333 · Cited by 105
Fault-tolerant quantum computing with color codes
Landahl, A. J., Anderson, J. T., & Rice, P. R. (2011) · arXiv · doi:10.48550/arxiv.1108.5738 · Cited by 79
NP-hardness of decoding quantum error-correction codes
Hsieh, M.-H., & Le Gall, F. (2011) · Physical Review A · doi:10.1103/physreva.83.052331 · Cited by 71
A small quantum computer is needed to optimize fault-tolerant protocols
Iyer, P., & Poulin, D. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab73c · Cited by 34
Quantum CNOT Circuits Synthesis for NISQ Architectures Using the Syndrome Decoding Problem
de Brugière, T. G., Baboulin, M., Valiron, B., Martiel, S., & Allouche, C. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-52482-1_11 · Cited by 18
A New Sieving-Style Information-Set Decoding Algorithm
Guo, Q., Johansson, T., & Nguyen, V. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3457150 · Cited by 12
(2020) · doi:10.1007/978-3-030-64837-4_12 · Cited by 11
Schuster, T., Kalyan, A., Polozov, O., & Kalai, A. T. (2021) · arXiv · doi:10.48550/arxiv.2106.05784 · Cited by 2
Metadata
- Authors
- Berlekamp, E., McEliece, R., & van Tilborg, H.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1978-05
- Volume
- 24
- Issue
- 3
- Pages
- 384-386
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2035929826
- Cited by
- 1,523
- References
- 0
- FWCI
- 2.60
- 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.
