The DOI matches its Crossref record.
Error Detection and Correction
Abstract
This chapter deals with the algorithms optimizing the redundancy that has to be added in order to achieve this automatic correction. It introduces the main error-detecting codes and error-correcting codes which are used in practice: Cyclic Redundancy Checks (CRC) codes, Low Density Parity Check (LDPC) codes, Reed-Solomon codes, and turbo codes. The chapter presents the main principles that support error correction, and illustrates everyday life examples, such as barcodes and bank account and credit card numbers. It presents an additional theoretical formalization, which deals with distance between codewords. This formalization is useful to construct more involved codes and to show their usefulness in technology. The chapter concludes with the convolutional codes and the turbo codes that are built using interleaving.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cited by
Sorted by citations
ОСОБЛИВОСТІ ФОРМУВАННЯ КОДОВОЇ НАДЛИШКОВОСТІ У КАНАЛАХ ПЕРЕДАЧІ ІНФОРМАЦІЇ
Boiko, J., Semenko, A., & Пятін, І. С. (2023) · Інфокомунікаційні та комп’ютерні технології · doi:10.36994/2788-5518-2022-02-04-01 · Cited by 2
Metadata
- Authors
- Dumas, J., Roch, J.-L., Tannier, É., & Varrette, S.
- Venue
- Foundations of Coding
- Publisher
- Wiley
- Published
- 2015-01-26
- Pages
- 209-276
- OpenAlex
- W1555816854
- Cited by
- 1
- References
- 0
- Citations by year
- 2023: 1
- Type
- other
- Language
- en
- Open access
- closed
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Error Correcting Code Techniques
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Keywords
- error detection, error correction, cyclic redundancy check, LDPC codes, Reed-Solomon codes, turbo codes, convolutional codes, interleaving, Hamming distance, redundancy optimization, barcodes, credit card numbers
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.
A second model labelled each claim on 2026-10-26 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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: Error Detection and Correction. https://app.cochat.ai/papers/10.1002/9781119005940.ch4
- The paper
- Dumas, J., Roch, J.-L., Tannier, É., & Varrette, S. (2015). Error Detection and Correction. Foundations of Coding. https://doi.org/10.1002/9781119005940.ch4
