The 4-adic complexity of interleaved quaternary sequences of even period with optimal autocorrelation

Abstract

Su, Yang, Zhou, and Tang proposed several new classes of optimal autocorrelation interleaved quaternary sequences with period 2n from the twin-prime sequence pairs or GMW sequence pairs. In this paper, we determine the 4-adic complexity of these quaternary sequences by using the correlation function. Our results show that the 4-adic complexity of these quaternary sequences exceeds \(\frac{2n-16}{6}\), so that they are safe enough to resist the attack of the rational approximation algorithm.