DocumentCode :
3399356
Title :
Generation of linear recursive sequences from irreducible polynomials over GF(Q)
Author :
Lam, Maurice S.
Author_Institution :
Dept. of Eng., Purdue Univ., Fort Wayne, IN, USA
fYear :
1991
fDate :
14-17 May 1991
Firstpage :
261
Abstract :
Linear recursive sequences generated from irreducible polynomials over GF(q), q=Pm, a prime power, are investigated. These sequences are expressed as vector linear recursive sequences whose component sequences may be obtained directly from an irreducible polynomial over GF(p). The relationship between these components is investigated. A method of generating the primitive and nonprimitive irreducible polynomials is also discussed
Keywords :
information theory; matrix algebra; polynomials; digital communication; irreducible polynomials; linear recursive sequences; nonprimitive type; primitive type; Digital communication; Linear feedback shift registers; Polynomials; Power engineering and energy; Power generation; Symmetric matrices; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 1991., Proceedings of the 34th Midwest Symposium on
Conference_Location :
Monterey, CA
Print_ISBN :
0-7803-0620-1
Type :
conf
DOI :
10.1109/MWSCAS.1991.252049
Filename :
252049
Link To Document :
بازگشت