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.

中文翻译：

---

最优自相关偶周期交错四元序列的4进复杂度

Su、Yang、Zhou 和Tang从双素数序列对或GMW 序列对中提出了几类新的周期为2 n的最佳自相关交错四元序列。在本文中，我们使用相关函数确定这些四元序列的 4-adic 复杂度。我们的结果表明，这些四元序列的 4-adic 复杂度超过了\(\frac{2n-16}{6}\)，因此它们足够安全，可以抵抗有理逼近算法的攻击。