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 upv -periodic 1 sequence under gcd (u, p) = 1 to the computation of maximum of some linear complexities of pv -periodic sequences over Fp. After combining with the Berlekamp-Massy algorithm or generalized Games-Chan algorithm, we could efficiently compute the linear complexity of pv -periodic sequence. Thus we present an efficient and attractive algorithm for calculating the linear complexity of upv -periodic sequences.