论文部分内容阅读
In this paper, for the the primes p such that 3 is a divisor of p - 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(pm)(any positive integer m) with the period 3n (n and pm - 1 are coprime) to the computat