Tang–Gong interleaved sequences constructed from the generalized GMW sequence pair are a class of binary sequences with optimal autocorrelation magnitude. In this paper, the symmetric 2-adic complexity of these sequences is investigated. We first derive a lower bound on their 2-adic complexity by extending the method proposed by Hu. Then, by analysing the algebraic structure of these sequences, a lower bound on their symmetric 2-adic complexity is obtained. Our result shows that the symmetric 2-adic complexity of these sequences is large enough to resist attacks with the rational approximation algorithm.

中文翻译：

---

广义 GMW 序列对唐功交错序列的对称 2-adic 复杂度

由广义GMW序列对构造的唐功交错序列是一类具有最佳自相关幅度的二值序列。在本文中，研究了这些序列的对称 2-adic 复杂度。我们首先通过扩展 Hu 提出的方法得出其 2-adic 复杂度的下界。然后，通过分析这些序列的代数结构，获得其对称 2-adic 复杂度的下界。我们的结果表明，这些序列的对称 2-adic 复杂度足够大，足以抵抗有理逼近算法的攻击。