On k-error linear complexity over F N of interleaved binary sequences derived from four N-periodic ones

Abstract

Abstract We estimate the k-error linear complexity of some interleaved sequences with period 4N over the finite field of order N (N an odd prime). Furthermore, we obtain the exact value of the k-error linear complexity for small value of k of the interleaved sequences obtained from the cyclotomic sequences. In particular, we study the interleaved sequences obtained from Legendre sequences and Hall’s sextic residue sequences, respectively. Our results show that these sequences are quite stable.