By Topic

Irreducible Polynomials Which Divide Trinomials Over GF (2)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Golomb, S.W. ; Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA ; Pey-Feng Lee

The simplest linear shift registers to generate binary sequences involve only two taps, which corresponds to a trinomial over GF(2). It is therefore of interest to know which irreducible polynomials f(x) divide trinomials over GF(2), since the output sequences corresponding to f(x) can be obtained from a two-tap linear feedback shift register (with a suitable initial state) if and only if f(x) divides some trinomial t(x)=xm+xa+1 over GF(2). In this paper, we develop the theory of which irreducible polynomials do, or do not, divide trinomials over GF(2). Then some related problems such as Artin's conjecture about primitive roots, and the conjectures of Blake, Gao, and Lambert, as well as of Tromp, Zhang, and Zhao are discussed

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 2 )