|On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude
|Minghui Yang, Lulu Zhang, Chinese Academy of Sciences，Institute of Information Engineering, China; Keqin Feng, Tsinghua University, China
|Topics in Information Theory
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences with optimal autocorrelation magnitude was constructed (Des. Codes and Cryptogr., 2018). Later, Sun et al. determined the upper and lower bounds of the 2-adic complexity of such sequences (SETA, 2018). In this paper, 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.