Relationships between m-sequences over GF(q) and GF(q/sup m/)
W.J. Park, John Joseph Komo · IEEE Transactions on Information Theory · 1989
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).>