Andere Kunden interessierten sich auch für
![Weight distribution of binary cyclic codes having the all-one vector]( "Weight distribution of binary cyclic codes having the all-one vector")
Weight distribution of binary cyclic codes having the all-one vector18,99 €![An Introduction to Cyclic Path Covers in Graphs]( "An Introduction to Cyclic Path Covers in Graphs")
An Introduction to Cyclic Path Covers in Graphs46,99 €![Groups of order 32 and their endomorphism semigroups]( "Groups of order 32 and their endomorphism semigroups")
Groups of order 32 and their endomorphism semigroups36,99 €![Quintic Irreducible Binary Goppa Codes of Length 32]( "Quintic Irreducible Binary Goppa Codes of Length 32")
Quintic Irreducible Binary Goppa Codes of Length 3232,99 €![Redundancy in Semidefinite Programming]( "Redundancy in Semidefinite Programming")
Redundancy in Semidefinite Programming38,99 €![Cyclic Difference Sets]( "Cyclic Difference Sets")
Cyclic Difference Sets21,99 €![A Look at the New Logistic Models with]( "A Look at the New Logistic Models with")
A Look at the New Logistic Models with "Polynomial Variable Transfer"27,99 €
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.