The k-error Linear Complexity of Whiteman Generalized Cyclotomic Sequences of Period pq of Order 2

摘要

This paper considers k—error linear complexity of a Whiteman generalized cyclotomic sequence of period pq of order 2. This sequence has been proved to possess high enough linear complexity and low enough autocorrelation by Cunsheng Ding. Our results show that if certain few bits of the binary sequence are changed, the linear complexity of the new sequence will become so low that the sequence can not keep resistent against the attack of BerlekampMassey Algorithm.