Based on this property,the definition of k-error intensive statistical complexity is presented and two basic properties of it are proved in this paper,which can be used to measure the stability of complexity of chaos-based pseudorandom sequences.

A relationship between the linear complexity and the k-error linear complexity of q-ary sequences with periodp~mq~n;

According to the theory of stream ciphers in cryptology,the 2-adic complexity and the k-error 2-adic complexity similar to other complexity measures must have large values.

Linear complexity and k-error linear complexity for 2~mp~n-periodic binary sequences;

Algorithm for the k-error linear complexity of binary sequences with period 2p~m;

Upper bound of expected value of the k-error linear complexity of random periodic sequences;

The linear complexity and the k-error linear complexity of p~n-periodic binary sequences;

An efficient algorithm for the k-error linear complexity of periodic sequences;

Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences.

A fast algorithm for determining k-error linear complexity profile of a binary sequence with period P~n;