Thread: CRC Polynomial
View Single Post
  #1  
Old 03-24-2016, 05:00
dila dila is offline
Friend
 
Join Date: Jan 2010
Posts: 60
Rept. Given: 12
Rept. Rcvd 32 Times in 14 Posts
Thanks Given: 35
Thanks Rcvd at 74 Times in 20 Posts
dila Reputation: 32
CRC Polynomial

I understand that the CRC is calculated by dividing the message by the CRC polynomial, and the checksum is the remainder of this division.

My question is, if the polynomial is, for example:

x^26 + x^23 + x^22 + x^16 + x^12 + x^11 + x^10 + x^8 + x^7 + x^5 + x^4 + x^2 + x + 1

Then why would my checksum ever have the top 5 bits set, because surely the remainder must be strictly less than the modulus?
Reply With Quote