![]() |
|
#2
|
|||
|
|||
|
CRC polynominals have always the highest degree (bit) set.
The full CRC32 polynominal you've posted is x^32 + x^26 + x^23 + x^22 + ... The x^32 part sometimes gets ommited, since you would need 33 bits to represent that number. Since you don't do an integer division but rather a polynominal division this is no problem. |
| Tags |
| checksum, crc |
| Thread Tools | |
| Display Modes | |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| How to compute the inverse of a polynomial under GF(2^8) ? | BlackWhite | General Discussion | 0 | 10-10-2015 21:24 |