Journal of Algebra, Number Theory: Advances and Applications
Author's: Yongsheng Tang and Heqian Xu
Pages: [1] - [16]
Received Date: November 15, 2018
Submitted by:
DOI: http://dx.doi.org/10.18642/jantaa_7100122020
Let 
be a linear recurring sequence over 
where each 
is a linear recurring sequence over 
with minimal polynomial 
over and the finite field is a subfield of finite field 
Let T be a linear transformation of
over 
Denote 
where 
is a linear transformation of over 
In this paper, we study the minimal polynomial
and linear complexity of linear recurring sequence 
If the canonical factorization of each
in 
is known, we determine the minimal polynomial
and linear complexity of linear recurring sequence 
over Furthermore, we determine the minimal
polynomial of 
if the minimal polynomial of each without multiple roots is known.
linear recurring sequences, linear complexity, minimal polynomial.
