Linear Complexity of Binary Interleaved Sequences of Period 4n

Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been constructed. In the application of cryptography, such binary sequences are required to have larger linear complexity. Tang and Ding cite{X. Tang} presented a method to construct a series of binary sequences with period 4$n$ having optimal autocorrelation. Such sequences are interleaved by two arbitrary binary sequences with period $nequiv 3pmod 4$ and ideal autocorrelation. In this paper we present a general formula on the linear complexity of such interleaved sequences. Particularly, we show that the linear complexity of such sequences with period 4$n$ is not bigger than $2n+2$. Interleaving by several types of known binary sequences with ideal autocorrelation ($m$-sequences, Legendre, twin-prime and Halls sequences), we present many series of such sequences having the maximum value $2n+2$ of linear complexity which gives an answer of a problem raised by N. Li and X. Tang cite{N. Li}. Finally, in the conclusion section we show that it can be seen easily that the 2-adic complexity of all such interleaved sequences reaches the maximum value $log_{2}(2^{4n}-1)$.