Abstract：The k-crror complexity of a periodic sequence of period N is denned as the smallest linear complexity that can be obtained by changing κ or fewer bits of the sequence per period. This correspondence shows the relationship between the linear complexity and the minimum value k for which the κ-error complexity is strictly less than the linear complexity, where period N equals to 2pq, q is an odd prime and 2 is a primitive root of mod q2.
2002, Vol. 24 
