The DOI matches its Crossref record.
Polynomial Codes Over Certain Finite Fields
Abstract
Previous article Next article Polynomial Codes Over Certain Finite FieldsI. S. Reed and G. SolomonI. S. Reed and G. Solomonhttps://doi.org/10.1137/0108018PDFPDF PLUSBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] R. W. Hamming, Error detecting and error correcting codes, Bell System Tech. J., 29 (1950), 147–160 MR0035935 CrossrefISIGoogle Scholar[2] Irving S. Reed, A class of multiple-error-correcting codes and the decoding scheme, Trans. I.R.E., PGIT-4 (1954), 38–49, Prof. Group on Information Theory MR0089789 Google Scholar[3] Neal Zierler, Linear recurring sequences, J. Soc. Indust. Appl. Math., 7 (1959), 31–48 10.1137/0107003 MR0101979 0096.33804 LinkISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore MatricesUmberto MartÍnez-Pen͂asSIAM Journal on Discrete Mathematics, Vol. 36, No. 3 | 16 August 2022AbstractPDF (562 KB)Algorithmic Fault Tolerance Using the Lanczos MethodSIAM Journal on Matrix Analysis and Applications, Vol. 13, No. 1 | 31 July 2006AbstractPDF (1962 KB)A New Class of Cyclic CodesSIAM Journal on Applied Mathematics, Vol. 16, No. 1 | 12 July 2006AbstractPDF (1580 KB)Multiple-Burst Error Correction with the Chinese Remainder TheoremJournal of the Society for Industrial and Applied Mathematics, Vol. 11, No. 1 | 13 July 2006AbstractPDF (758 KB)A Class of Error-Correcting Codes in $p^m $ SymbolsDaniel Gorenstein and Neal ZierlerJournal of the Society for Industrial and Applied Mathematics, Vol. 9, No. 2 | 10 July 2006AbstractPDF (691 KB) Volume 8, Issue 2| 1960Journal of the Society for Industrial and Applied Mathematics225-424 History Submitted:21 January 1959Published online:10 July 2006 InformationCopyright © 1960 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0108018Article page range:pp. 300-304ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics
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
Luby, M. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181950 · Cited by 2,757
Deep Learning Enabled Semantic Communication Systems
Xie, H., Qin, Z., Li, G. Y., & Juang, B.-H. (2021) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2021.3071210 · Cited by 1,602
RapidChain: Scaling Blockchain via Full Sharding
Zamani, M., Movahedi, M., & Raykova, M. (2018) · Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3243734.3243853 · Cited by 1,121
Phase change memory technology
Burr, G. W., Breitwisch, M. J., Franceschini, M., Garetto, D., Gopalakrishnan, K., Jackson, B., Kurdi, B., Lam, C., Lastras, L. A., Padilla, A., et al. (2010) · Journal of Vacuum Science & Technology B, Nanotechnology and Microelectronics: Materials, Processing, Measurement, and Phenomena · doi:10.1116/1.3301579 · Cited by 916
Robust Chemical Preservation of Digital Information on DNA in Silica with Error-Correcting Codes
Grass, R. N., Heckel, R., Puddu, M., Paunescu, D., & Stark, W. J. (2015) · Angewandte Chemie International Edition · doi:10.1002/anie.201411378 · Cited by 754
Metadata
- Authors
- Reed, I. S., & Solomon, G.
- Venue
- Journal of the Society for Industrial and Applied Mathematics
- Published
- 1960-06
- Volume
- 8
- Issue
- 2
- Pages
- 300-304
- ISSN
- 0368-4245 (ISSN-L)
- 2168-3484
- OpenAlex
- W2148575324
- Cited by
- 3,662
- References
- 0
- FWCI
- 2.45
- 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: Polynomial Codes Over Certain Finite Fields. https://app.cochat.ai/papers/10.1137/0108018
- The paper
- Reed, I. S., & Solomon, G. (1960). Polynomial Codes Over Certain Finite Fields. Journal of the Society for Industrial and Applied Mathematics. https://doi.org/10.1137/0108018
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.
