In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period $2p$ and $2(2^n-1)$ with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282-285, 2009) and Jang et al. (ISIT, pp. 278-281, 2009), respectively. Our results show that the 4-adic complexity of the quaternary sequences defined in these two papers is large enough to resist the attack of the rational approximation algorithm.
翻译:在本文中,我们确定基姆等人分别界定了2p美元和2(2)n-1美元之间平衡的四边序列的4个复杂度(ISIT,第282-285页,2009年)和张等人分别界定了理想的离心机关系(ISIT,第282-285页,2009年)和(ISIT,第278-281页,2009年)。我们的结果表明,这两份文件界定的四边序列的4个复杂度足以抵御理性近似算法的攻击。