Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,271,882 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
CRC-based framing
Checksum
Coefficient
Cyclic redundancy check
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Evaluating Hamming Distance as a CRC-based Side-channel Detection Measure in Wi-Fi Networks
Visal Chea
,
Miguel Vargas Martin
,
R. Liscano
ANT/SEIT
2016
Corpus ID: 24977167
2015
2015
Hamming distance as a metric for the detection of CRC-based side-channel communications in 802.11 wireless networks
Visal Chea
,
Miguel Vargas Martin
,
R. Liscano
IEEE Conference on Communications and Network…
2015
Corpus ID: 16625968
Wireless technology has become a main player in communication through its desirable mobility characteristic. However, like many…
Expand
2013
2013
Polynomial Representations of Polar Codes and Decoding under Overcomplete Representations
M. Chiu
IEEE Communications Letters
2013
Corpus ID: 12513017
This letter proposes an alternative expression of polar codes using polynomial representations. Polynomial representations may…
Expand
2012
2012
Reciprocal polynomials with all but two zeros on the unit circle
DoYong Kwon
2012
Corpus ID: 54717634
We derive sufficient conditions under which all but two zeros of reciprocal polynomials lie on the unit circle, and specify the…
Expand
2012
2012
On zeros of self-reciprocal polynomials
Masatoshi Suzuki
2012
Corpus ID: 119717903
We establish a necessary and sufficient condition for all zeros of a self-reciprocal polynomial to lie on the unit circle…
Expand
2010
2010
Structure of polynomial representations for orthosymplectic Lie superalgebras
Cuiling Luo
2010
Corpus ID: 115174693
Orthosymplectic Lie superalgebras are fundamental symmetries in modern physics, such as massive supergravity. However, their…
Expand
2008
2008
On the parity of the number of irreducible factors of self-reciprocal polynomials over finite fields
O. Ahmadi
,
G. Vega
Finite Fields Their Appl.
2008
Corpus ID: 10113787
2007
2007
Circular interlacing with reciprocal polynomials
P. Lakatos
,
L. Losonczi
2007
Corpus ID: 123320668
The purpose of this paper is to show that all zeros of the reciprocal polynomial
2002
2002
Galois Theory of Reciprocal Polynomials
P. Viana
,
Paula M. Veloso
The American mathematical monthly
2002
Corpus ID: 589114
1969
1969
Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes
David Knee
,
H. Goldman
IEEE Transactions on Information Theory
1969
Corpus ID: 37926649
We consider the problem of determining which irreducible polynomials with coefficients in a finite field GF(q) are quasi-self…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE