On the 2-adic complexity of a class of binary sequences of period $4p$ with optimal autocorrelation magnitude

Abstract

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is quite good \cite{C. Fan}. Recently, Sun et al. determined the upper and lower bounds of the 2-adic complexity of such sequences \cite{Y. Sun3}. We determine the exact value of the 2-adic complexity of this class of sequences. The results show that the 2-adic complexity of this class of binary sequences is close to the maximum.