A checksum is a sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that the total number of 1s is always even ("even parity") or odd ("odd parity"). A significantly more sophisticated checksum is the cyclic redundancy check (or CRC), which is based on the algebra of polynomials over the integers (mod 2). It is substantially more reliable in detecting transmission errors, and is one common error-checking protocol used in modems.

# Checksum

## See also

Cyclic Redundancy Check, Error-Correcting Code## Explore with Wolfram|Alpha

## References

Press, W. H.; Flannery, B. P.; Teukolsky, S. A.; and Vetterling, W. T. "Cyclic Redundancy and Other Checksums." Ch. 20.3 in*Numerical Recipes in FORTRAN: The Art of Scientific Computing, 2nd ed.*Cambridge, England: Cambridge University Press, pp. 888-895, 1992.

## Referenced on Wolfram|Alpha

Checksum## Cite this as:

Weisstein, Eric W. "Checksum." From *MathWorld*--A Wolfram Web Resource. https://mathworld.wolfram.com/Checksum.html