32-Bit Cyclic Redundancy Code Polynomial

A 32-bit cyclic redundancy code is a type of algebraic polynomial in x with coefficients from a set A of binary numbers. It is used to detect accidental alterations of data during coding and decoding. Castagnoli's results on the algorithmic selection of CRC provide codes which can detect up to 5 errors. In this study we use polynomial algebra over the field and the geometry of the code space to model a class of 32-bit CRC polynomials which can detect up to 7 errors.

Autorentext

The author holds MSC degree (Pure - Mathematics) from Masinde Muliro University of Science and Technology and is currently a PhD candidate at the same university. He holds a B.ED [Science] degree from Kenyatta University. He is a lecturer at both Masinde Muliro University of Science and Technology and Mt. Kenya University, Kakamega campus.