cyclic-redundancy-check · shipping · also CRC

Cyclic redundancy check

A cyclic redundancy check is an error-detection code computed using polynomial division over binary coefficients.

Related Observatory article: Cyclic redundancy check on hesela.com

Specify the generator, protected length and bit conventions; output width alone does not define detection coverage. [1] Hesela supplies deliberately constructed, same-length payload changes with unchanged CRC values, including a common-multiple pattern that passes both IEEE CRC-32 and CRC-32C. The examples do not estimate collision frequencies or establish independence between checks. [2]

Relations

related
Checksum, CRC-32C, CRC burst error, Hamming distance

Limitations

  • A CRC does not authenticate data against intentional modification. [1]

Citations

  1. Sheinwald et al. RFC 3385: iSCSI CRC/Checksum Considerations, sections 2-3 and 10 (2002) (accessed 2026-10-18)
  2. Hesela: CRC polynomials, constructed error patterns and exact small-code enumeration (accessed 2026-10-18)

JSON: /data/terms/cyclic-redundancy-check.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Cyclic redundancy check. Hesela. 2026-10-19. https://hesela.dev/terms/cyclic-redundancy-check/