By Topic

Synthesis and uniqueness of m-sequences over GF(qn) as n-phase sequences over GF(q)

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)
Guang Gong ; Dept. of Appl. Math., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Guo Zheng Xiao

The construction of m-sequences over GF(qn) from known m-sequences over GF(q) is discussed. An algorithm is given which generates m-sequences over GF(qn) from m-sequences over GF(q), where n phase shifts of known m-sequences over GF(q) are determined by the iterative polynomials. It is shown that n shift distinct m-sequences over GF(qn) generated by the same m-sequences over GF(q) are unique when the elements of GF(qn) are represented by n-tuples of the elements from GF(q)

Published in:

Communications, IEEE Transactions on  (Volume:42 ,  Issue: 8 )