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.
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
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
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
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
Online Matching and Ad Allocation
Mehta, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000057 · Cited by 387
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
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.