The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
The Art of Error Correcting Coding
Open accessAbstract
Designations used by
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
(1988) · Cited by 16,582
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
Factor graphs and the sum-product algorithm
Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486
Optimal decoding of linear codes for minimizing symbol error rate
Bahl, L. R. (1974) · IEEE Transactions on Information Theory · Cited by 4,665
Near Shannon limit error-correcting coding and decoding : Turbo-codes
Berrou, C. (1993) · International Conference on Communications · Cited by 4,264
Channel coding with multilevel/phase signals
Ungerboeck, G. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056454 · Cited by 3,751
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
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
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
Cited by
Error-correcting barcoded primers for pyrosequencing hundreds of samples in multiplex
Hamady, M., Walker, J. J., Harris, J. K., Gold, N. J., & Knight, R. (2008) · Nature Methods · doi:10.1038/nmeth.1184 · Cited by 1,310
Metadata
- Authors
- Morelos‐Zaragoza, R. H.
- Venue
- Wiley eBooks
- Publisher
- Wiley
- Published
- 2002-03-11
- OpenAlex
- W1535801681
- Cited by
- 376
- References
- 49
- FWCI
- 2.10
- Type
- book
- Language
- en
- Open access
- bronze
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: The Art of Error Correcting Coding. https://app.cochat.ai/papers/10.1002/0470847824
- The paper
- Morelos‐Zaragoza, R. H. (2002). The Art of Error Correcting Coding. Wiley eBooks. https://doi.org/10.1002/0470847824
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.