DocumentCode :
891905
Title :
Primitive polynomials and m-sequences over GF(q m)
Author :
Komo, John J. ; Lam, Maurice S.
Author_Institution :
Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
Volume :
39
Issue :
2
fYear :
1993
fDate :
3/1/1993 12:00:00 AM
Firstpage :
643
Lastpage :
647
Abstract :
Procedures for obtaining primitive polynomials and m-sequences over GF(qm) in terms of primitive polynomials and m-sequences over GF(q) are presented. Using a degree mn primitive polynomial g( x) in GF[g, x], an m-sequence over GF(qm) can be expressed as a vector m-sequence whose component m-sequences are shifted versions of the m-sequence generated by g(x). The degree-n primitive polynomials in GF[qm,x] with root αqi , that are factors of g(x) with root α when g(x) is viewed in GF[qm,x ], are then developed from the m-sequence over GF(q m). Expressions for the shifts and corresponding primitive polynomial for the m-sequence generated by the u th decimation of the m-sequence generated by the polynomials are also given. Expressions for the shifts and corresponding primitive polynomial factors of g(x) for different bases expressing GF(qm) over GF(q) are presented
Keywords :
binary sequences; information theory; polynomials; GF(qm); m-sequences; primitive polynomials; Polynomials;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.212297
Filename :
212297
Link To Document :
بازگشت