Error-Detecting Codes (CRC)
Bit strings represented as polynomials
- 110001 = 1x^5 + 1x^4 + 0x^3 + 0x^2 +0x^1 + 1x^0
- Highest order bit (of k bits) is the coefficient of x^(k-1).
- The polynomial is said to be of degree k-1
- Polynomial addition and subtraction is done modulo 2
- 10011011 + 11001010 = 01010001
- Division is same as binary but subtraction is done modulo 2.