Skip to search formSkip to main contentSkip to account menu

Mathematics of cyclic redundancy checks

Known as: Mathematics of CRCs, Mathematics of crc, Mathmatics of CRCs 
The cyclic redundancy check (CRC) is based on division in the ring of polynomials over the finite field GF(2) (the integers modulo 2), that is, the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We study the complexity of Boolean constraint satisfaction problems (CSPs) when the assignment must have Hamming weight in some… 
2018
2018
Coterm polynomials are introduced by Oztas et al. [a novel approach for constructing reversible codes and applications to DNA… 
2017
2017
We give a lower bound of the Mahler measure on a set of polynomials that are ‘almost’ reciprocal. Here ‘almost’ reciprocal means… 
2013
2013
This letter proposes an alternative expression of polar codes using polynomial representations. Polynomial representations may… 
2013
2013
Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these… 
2011
2011
According to the properties of the first kind and the second kind Chebyshev polynomials,Chebyshev transform of some nonzero… 
2010
2010
Orthosymplectic Lie superalgebras are fundamental symmetries in modern physics, such as massive supergravity. However, their… 
2006
2006
Machining is one of the most important operations in many industrial environments. To prosper in today's competitive industrial…