The Generalized Construction and Linear Complexity of Binary Sequences with Three-Level Autocorrelation Values

Binary sequences with good autocorrelation and large linear complexity are needed in many applications. As an application of theory of interleaved sequences, one family of binary pseudo-random sequences is constructed. Furthermore, the autocorrelation values and linear complexity of such constructed binary sequences are derived in this paper.