Reducing the Computation of the linear complexity of upv -periodic sequences
We present a fast algorithm that reduced the computation of the linear complexity of the up<sup>v</sup> -periodic <sup>1</sup> sequence under gcd (u, p) = 1 to the computation of maximum of some linear complexities of p<sup>v</sup> -periodic sequences over F<inf>p</inf>. After combining with the Berlekamp-Massy algorithm or generalized Games-Chan algorithm, we could efficiently compute the linear complexity of p<sup>v</sup> -periodic sequence. Thus we present an efficient and attractive algorithm for calculating the linear complexity of up<sup>v</sup> -periodic sequences.