2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude

2-Adic complexity of two constructions of binary sequences with period 4N and optimal autocorrelation magnitude
复制标题

DOI:
10.1007/s12095-021-00498-8
复制
发表时间:
2021-07
期刊:
Cryptography and Communications
影响因子:
--
通讯作者:
Zibi Xiao;Xiangyong Zeng
Zibi Xiao;Xiangyong Zeng
中科院分区:
其他
文献类型:
--
作者:
Zibi Xiao;Xiangyong Zeng

文献摘要

被引文献

相似文献

Tang和Gong基于交织技术提出了三种具有最佳自相关值或最佳自相关幅度的周期为4 N的二元序列的构造方法。本文研究了由Legendre序列偶和孪生素数序列偶构造的具有最佳自相关幅度的序列的2-adic复杂度。利用Hu提出的方法,通过计算序列的精确自相关分布和讨论最大公约数,完全确定了序列的2-adic复杂度。结果表明,这些序列的2-adic复杂度要么是最大值,要么非常接近最大值。
Three constructions of binary sequences with period 4Nand optimal autocorrelation value or optimal autocorrelation magnitude have been presented by Tang and Gong based on interleaving technique. In this paper, the 2-adic complexity of the sequences with optimal autocorrelation magnitude constructed from the Legendre sequence pair or the twin-prime sequence pair is investigated. With the method proposed by Hu, we completely determine the 2-adic complexity of the sequences by calculating the exact autocorrelation distribution of the sequences and discussing the greatest common divisors. Results show that the 2-adic complexity of these sequences is either maximum or very close to maximum.