The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
On subfield subcodes of modified Reed-Solomon codes (Corresp.)
Abstract
A simple approach to recent generalizations of BCH and Goppa codes, viewed as subfield subcodes of modified Reed-Solomon codes, is presented. The orthogonal complements of these codes are characterized, and generalized versions of some previous results about minimum distance and decoding are obtained.
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
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Berlekamp, E. R. (1973) · IEEE Transactions on Information Theory · doi:10.1109/tit.1973.1055088 · Cited by 126
Cited by
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
Carlet, C., Ding, C., & Yuan, J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.847722 · Cited by 408
Blake, I., Heegard, C., Hoholdt, T., & Wei, V. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720550 · Cited by 265
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
- Delsarte, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1975-09
- Volume
- 21
- Issue
- 5
- Pages
- 575-576
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2020484625
- Cited by
- 277
- References
- 3
- FWCI
- 2.11
- 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: On subfield subcodes of modified Reed-Solomon codes (Corresp.). https://app.cochat.ai/papers/10.1109/tit.1975.1055435
- The paper
- Delsarte, P. (1975). On subfield subcodes of modified Reed-Solomon codes (Corresp.). IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1975.1055435
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.