Linear complexity problem of binary Jacobi sequence

This paper contributes to the stability of linear complexity of a binary periodic Jacobi sequence. By employing a pair of reference sequences, we prove that the linear complexity of a binary Jacobi sequence is unstable, namely, by changing its few bits in one-period length, the linear complexity of the modified sequences will become far less than the required value.