A Class Of Autocorrelation And Linear Complexity Of Binary Sequences Of Even Length

The autocorrelation and linear complexity are important indicators that measure good or bad property of the pseudo-random sequence.The sequence with good autocorrelation and linear complexity has been widely applied in the communication system and cryptography.In the paper,we always assume that N is the odd number and Z_N is the residual class ring of modular N.Firstly,using difference sets overZ_N,we construct a class of binary sequences of period 2N or 4N and give their autocorrelation values with four-valued.If two special points are removed,they are optimal.Secondly,using almost difference sets overZ_N,we construct a class of binary sequences of period 2N or 4N and obtain their autocorrelation values with six-valued.If two special points are removed,they are almost optimal.Finally,we compute the linear complexity N+1 of a binary sequence of period 2N,so it has good random characteristics.