On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude
On the 2-Adic Complexity of A Class of Binary Sequences of Period 4p with Optimal Autocorrelation Magnitude
复制标题
DOI：
10.1109/isit44484.2020.9174142
复制
发表时间：
2019-04
期刊：
影响因子：
--
通讯作者：
Minghui Yang;Lulu Zhang;K. Feng
中科院分区：
文献类型：
--
作者：
Minghui Yang;Lulu Zhang;K. Feng
通过对Ding-Helleseth-Lam序列进行交织，构造了一类具有最佳自相关幅度的二元序列（Des.代码和密码，2018年）。后来，Sun等人确定了此类序列的2-adic复杂度的上限和下限（SETA，2018）。在本文中，我们确定了这类序列的2-adic复杂度的精确值。结果表明，这类二元序列的2-adic复杂度接近最大值。
Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences with optimal autocorrelation magnitude was constructed (Des. Codes and Cryptogr., 2018). Later, Sun et al. determined the upper and lower bounds of the 2-adic complexity of such sequences (SETA, 2018). In this paper, we determine the exact value of the 2-adic complexity of this class of sequences. The results show that the 2-adic complexity of this class of binary sequences is close to the maximum.