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… 
2015
2015
Wireless technology has become a main player in communication through its desirable mobility characteristic. However, like many… 
2013
2013
This letter proposes an alternative expression of polar codes using polynomial representations. Polynomial representations may… 
2012
2012
We establish a necessary and sufficient condition for all zeros of a self-reciprocal polynomial to lie on the unit circle… 
2011
2011
Transporting solid particles in oil and gas flow cause erosion damage to the pipeline and fittings. The aim of this thesis is to… 
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… 
1969
1969
We consider the problem of determining which irreducible polynomials with coefficients in a finite field GF(q) are quasi-self…