Mathematics of cyclic redundancy checks
Methods of error detection and correction in communications / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Mathematics of cyclic redundancy checks?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
The cyclic redundancy check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the set of polynomials where each coefficient is either zero or one, and arithmetic operations wrap around.
Any string of bits can be interpreted as the coefficients of a message polynomial of this sort, and to find the CRC, we multiply the message polynomial by and then find the remainder when dividing by the degree- generator polynomial. The coefficients of the remainder polynomial are the bits of the CRC.