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.

翻译：两种二进制序列的自动关系值在 [6] 中显示是好的。 我们研究了这些序列的二进制复杂性。 我们的结果表明,这些序列的二进制复杂性足以抵御理性近似算法的攻击。