Error-Detecting Codes (CRC)
When receiver gets checksummed frame, it divides by G(x). If remainder exists, then error occurred.
Algorithm
- r = degree of G(x). Append r zero bits to the lower-end of frame. Now we have m+r bits and this corresponds to the polynomial x^rM(x).
- Divide bit string corresponding to G(x) into the bit string corresponding to x^rM(x) using modulo 2 division.