On the linear complexity of interleaved binary sequences of period 4p obtained from hall sequences or legendre and hall sequences

Sequences with an optimal autocorrelation property and with large linear complexity are needed in certain communication systems and cryptography. Tang and Ding obtained new classes of almost balanced binary sequences with an optimal autocorrelation value. In this reported work, it is explored as to when interleaved binary sequences of period 4p obtained by Tang and Ding´s technique from Hall sequences or Legendre and Hall sequences possess high linear complexity.