论文标题
具有交织结构和最佳自相关幅度的Yu-Gong序列的2次复杂性
The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
论文作者
论文摘要
在2008年，Yu和Gong根据$ M $序列提出了一类时期$ n = 4（2^k-1）（2^k-1）（2^k-1）$，并具有最佳的自相关幅度，并以$ m $ - 序列为基础，这是完美的序列$（0,1,1,1,1,1,1）$ 4 $ $ 4 $ and netreaving Technique。在本文中，我们研究了这些序列的两种复杂性。 Our results show that they are larger than $N-2\lceil\mathrm{log}_2N\rceil+4 $ (which is far larger than $N/2$) and could attain the maximum value $N$ if suitable parameters are chosen, i.e., the 2-adic complexity of this class of interleaved sequences is large enough to resist the Rational Approximation Algorithm.
In 2008, a class of binary sequences of period $N=4(2^k-1)(2^k+1)$ with optimal autocorrelation magnitude has been presented by Yu and Gong based on an $m$-sequence, the perfect sequence $(0,1,1,1)$ of period $4$ and interleaving technique. In this paper, we study the 2-adic complexities of these sequences. Our results show that they are larger than $N-2\lceil\mathrm{log}_2N\rceil+4 $ (which is far larger than $N/2$) and could attain the maximum value $N$ if suitable parameters are chosen, i.e., the 2-adic complexity of this class of interleaved sequences is large enough to resist the Rational Approximation Algorithm.
