[Jump to code hierarchy]

Checksum code

Description

An error-detecting block code that appends to a message a shorter string, called a checksum, that is computed from the message.

Protection

The checksum can be recalculated from the received message and compared with the appended checksum in order to detect certain transmission or storage errors.

Realizations

Manuscript copying: the Masoretes counted the verses, words, and letters of biblical books, and Bible copyists counted letters and words for proofreading or salary purposes [1]. The Talmud states that the first sages counted all letters of the Torah [2].

Notes

See Refs. [4][3; Ch. 2] for surveys of check-digit schemes.See Ref. [5] for an evaluation of checksums and CRCs.

Cousin

  • Telegraph code— Telegraph codes protected numerical data with check digits or letters, which act as checksums over the plaintext and were usually computed modulo 10 [6; Sec. 3].

Primary Hierarchy

Parents
Checksum code
Children
The last digit of an ISBN-10 string is a check digit computed modulo 11 [7].
The \(q\)-ary parity check code is a simple example of a checksum code, with the parity of the message being the checksum.
The checksum of an arithmetic residue code is the residue of an integer modulo a check base.
The last digit of a UPC barcode is a base-10 check digit computed modulo 10 from an alternating weighted sum of the preceding digits [8].

References

  1. [1]

    B. Ycart, “Letter counting: a stem cell for Cryptology, Quantitative Linguistics, and Statistics”, (2012) arXiv:1211.6847

  2. [2]

    Babylonian Talmud, Kiddushin 30a, William Davidson Edition URL

  3. [3]

    J. Verhoeff, Error Detecting Decimal Codes, Mathematical Centre Tracts 29 (Mathematisch Centrum, Amsterdam, 1969) URL

  4. [4]

    J. A. Gallian, “Error detection methods”, ACM Computing Surveys 28, 504 (1996) DOI

  5. [5]

    T. C. Maxino and P. J. Koopman, “The Effectiveness of Checksums for Embedded Control Networks”, IEEE Transactions on Dependable and Secure Computing 6, 59 (2009) DOI

  6. [6]

    S. M. Bellovin, “Compression, correction, confidentiality, and comprehension: a modern look at telegraph codebooks”, Cryptologia 50, 374 (2025) DOI

  7. [7]

    R. Hill, A First Course in Coding Theory (Oxford University Press, 1988)

  8. [8]

    D. Savir and G. J. Laurer, “The characteristics and decodability of the Universal Product Code symbol”, IBM Systems Journal 14, 16 (1975) DOI

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: checksum

Cite as:
“Checksum code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/checksum, arXiv:2606.11484
BibTeX:
@incollection{eczoo_checksum,
title={Checksum code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/checksum}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/checksum

Cite as:

“Checksum code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/checksum, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/classical/properties/block/checksum.yml.