Abstract：Cryptographically strong sequences not only should have a large linear com-plexity, but also no a significant decrease of the linear complexity when a few terms are changed. This requirement leads to the concept of the /c-error linear complexity of periodic sequences. In the following two cases: (1) gcd(N,p) = 1; (2) N= pv, where p denotes the characteristic of the finite field GF(q), the counting function NN,o(c), i.e., the number of N-periodic sequences with given linear complexity c, is showed, the expected value of the linear complexity En,o is determined, and a useful lower bound on the expected value of the k-errov linear complexity EN,κ is established.
牛志华;白恩健;肖国镇. 周期序列线性复杂度与κ-错复杂度的数学期望[J]. 电子与信息学报, 2004, 26(11): 1787-1791 .
Niu Zhi-hua; Bai En-jian; Xiao Guo-zhen . On the Expected Value of the Linear Complexity and the k-Error Linear Complexity of Periodic Sequences. , 2004, 26(11): 1787-1791 .
2004, Vol. 26 
