Swan's theorem for binary tetranomials
From MaRDI portal
Publication:2490142
DOI10.1016/j.ffa.2005.05.011zbMath1163.11349OpenAlexW2076334265MaRDI QIDQ2490142
Donald W. Newhart, Alfred W. Hales
Publication date: 28 April 2006
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2005.05.011
Swan's theoremPseudo-random sequenceBinary tetronomialBinary trinomialCyclic redundancy checkIrreducible factorsParity sequence
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Polynomials over finite fields (11T06)
Related Items
A note on the reducibility of binary affine polynomials, The parity of the number of irreducible factors for some pentanomials, Swan-like results for binomials and trinomials over finite fields of odd characteristic, Parity of the number of irreducible factors for composite polynomials, A Swan-like note for a family of binary pentanomials, On the polynomial basis of \(\mathrm{GF}(2^n)\) having a small number of trace-one elements, A generalization of the Hansen-Mullen conjecture on irreducible polynomials over finite fields
Cites Work