The DOI matches its Crossref record.
Maximum distanceq-nary codes
Abstract
Aq-nary error-correcting code withN = q^{k}code words of lengthn = k + rcan have no greater minimum distancedthanr+1. The class of codes for whichd = r+1is studied first in general, then with the restriction that the codes be linear. Examples and construction methods are given to show that these codes exist for a number of values ofq, k, andr.
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
Karnin, E., Greene, J., & Hellman, M. (1983) · IEEE Transactions on Information Theory · doi:10.1109/tit.1983.1056621 · Cited by 630
Yeung, R. W., Li, S.-Y. R., Cai, N., & Zhang, Z. (2006) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000007 · Cited by 381
Reading and Writing Digital Data in DNA
Meiser, L. C., Antkowiak, P. L., Koch, J., Chen, W. D., Kohll, A. X., Stark, W. J., Heckel, R., & Grass, R. N. (2020) · Nature Protocols · doi:10.1038/s41596-019-0244-5 · Cited by 164
Metadata
- Authors
- Singleton, R.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1964-04
- Volume
- 10
- Issue
- 2
- Pages
- 116-118
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2050687505
- Cited by
- 533
- References
- 0
- FWCI
- 1.06
- 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: Maximum distanceq-nary codes. https://app.cochat.ai/papers/10.1109/tit.1964.1053661
- The paper
- Singleton, R. (1964). Maximum distanceq-nary codes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1964.1053661
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.
