Title :
A matrix algebra for the linear complexity of periodic sequences
Author_Institution :
Inst. for Inf.. Ind., Smart Network Syst. Inst., Taipei, Taiwan
Abstract :
A matrix algebra is presented for the linear complexity of periodic sequences over finite fields. An algorithm is developed to compute the rank of the circulant matrices and it can be viewed as a matrix formulation of Blackburn´s algorithm. The rank-nullity property is shown precisely between the pseudocirculant matrices and the Hasse matrices.
Keywords :
Galois fields; computational complexity; matrix algebra; sequences; Blackburn algorithm; Hasse matrix; finite field; linear complexity; matrix algebra; periodic sequence; pseudocirculant matrix; rank nullity property; Complexity theory; Galois fields; Matrices; Matrix converters; Polynomials; Tin; Vectors; GDFT; circulant matrices; linear complexity; periodic sequences;
Conference_Titel :
Information Security and Intelligence Control (ISIC), 2012 International Conference on
Conference_Location :
Yunlin
Print_ISBN :
978-1-4673-2587-5
DOI :
10.1109/ISIC.2012.6449697
