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

04/30/2019

∙

by   Minghui Yang, et al.

∙

0

∙

share

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period 4p with optimal autocorrelation magnitude was constructed in W. Su. Later, Fan showed that the linear complexity of this class of sequences is quite good C. Fan. Recently, Sun et al. determined the upper and lower bounds of the 2-adic complexity of such sequences 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.