Abstract
It is shown that m-sequences over GF(q/sup m/) of length q/sup nm/-1 corresponding to primitive polynomials in GF(q/sup m/,x) of degree n can be generated from known m-sequences over GF(q) of length q/sup nm/-1 obtained from primitive polynomials in GF(q,x) of degree mn. A procedure for generating the m-sequences over GF(q/sup 2/) from m-sequences over GF(q) was given which enables the generation of m-sequences over GF(p/sup 2n/). In addition it was shown that all of the primitive polynomials in GF(q,/sup m/,x) can be obtained from a complete set of the primitive polynomials in GF(q,x). >
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
