2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude

摘要

Three constructions of binary sequences with period 4N and optimal autocorrelation value or optimal autocorrelation magnitude have been presented by Tang and Gong based on interleaving technique. In this paper, the 2-adic complexity of the sequences with optimal autocorrelation magnitude constructed from the Legendre sequence pair or the twin-prime sequence pair is investigated. With the method proposed by Hu, we completely determine the 2-adic complexity of the sequences by calculating the exact autocorrelation distribution of the sequences and discussing the greatest common divisors. Results show that the 2-adic complexity of these sequences is either maximum or very close to maximum.