A few specific polynomials when used this way have desirable error detection/detection properties:
1. They will detect all errors involving an odd number of bits.
2. They will detect all single or double bit errors.
3. They will detect error bursts up to the length of the CRC.
4. They will detect most error bursts greater than the CRC in length.
These properties are much more extensive than those of checksum or parity which are guaranteed only to catch single bit errors and may fail in stuck bit situations.
Four CRC polynomials are in common use:
Parity is effectively CRC1 and is not a particularly effective polynomial.
Return To Index Copyright 1994-2002 by Donald Kenney.