The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack of the rational approximation algorithm.

中文翻译：

---

具有交错结构的两类二元序列的2-Adic复杂度

两类二进制序列的自相关值在[6]中被证明是好的。我们研究了这些序列的2-adic复杂性。我们的结果表明，此类序列的2-adic复杂度足以抵御有理逼近算法的攻击。