By Topic

Relationships between m-sequences over GF(q) and GF(qm)

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)
Park, W.J., Jr. ; Sch. of Eng., Univ. of the Pacific, Stockton, CA, USA ; Komo, J.J.

It is shown that m-sequences over GF(qm ) of length qnm-1 corresponding to primitive polynomials in GF[qm,x] of degree n can be generated from known m-sequences over GF(q) of length qnm-1 obtained from primitive polynomials in GF[q,x] of degree mn. A procedure for generating the m-sequences over GF(q2) from m-sequences over GF(q) was given which enables the generation of m-sequences over GF( p2n). In addition it was shown that all of the primitive polynomials in GF[q,m,x] can be obtained from a complete set of the primitive polynomials in GF[q ,x]

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 1 )