The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
Abstract
With the Delsarte-MacWilliams inequalities as a starting point, an upper bound is obtained on the rate of a binary code as a function of its minimum distance. This upper bound is asymptotically less than Levenshtein's bound, and so also Elias's.
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
Cites
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Szegő, G. (1939) · Colloquium Publications · doi:10.1090/coll/023 · Cited by 2,110
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_9 · Cited by 751
Cited by
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Nonbinary Stabilizer Codes Over Finite Fields
Ketkar, A., Klappenecker, A., Kumar, S., & Sarvepalli, P. K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.883612 · Cited by 623
Capacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3217 · Cited by 365
A new upper bound on the minimal distance of self-dual codes
Conway, J. H., & Sloane, N. J. A. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.59931 · Cited by 347
Enlargement of Calderbank-Shor-Steane quantum codes
Steane, A. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796388 · Cited by 264
Metadata
- Authors
- McEliece, R., Rodemich, E., Rumsey, H., & Welch, L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1977-03
- Volume
- 23
- Issue
- 2
- Pages
- 157-166
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2109084006
- Cited by
- 447
- References
- 3
- FWCI
- 4.83
- Type
- journal article
- 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: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. https://app.cochat.ai/papers/10.1109/tit.1977.1055688
- The paper
- McEliece, R., Rodemich, E., Rumsey, H., & Welch, L. (1977). New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1977.1055688
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.
