A matrix algebra for the linear complexity of periodic sequences

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.