On the p ‐Adic Complexity of the Ding‐Helleseth‐Martinsen Binary Sequences

On the p ‐Adic Complexity of the Ding‐Helleseth‐Martinsen Binary Sequences
复制标题

DOI:
10.1049/cje.2020.08.016
复制
发表时间:
2021
影响因子:
1.2
通讯作者:
Jin Xiaoyan;Xu Zhe-feng;Yang Minghui;Feng Keqin
Jin Xiaoyan;Xu Zhe-feng;Yang Minghui;Feng Keqin
中科院分区:
计算机科学4区
文献类型:
--
作者:
Jin Xiaoyan;Xu Zhe-feng;Yang Minghui;Feng Keqin

文献摘要

相似文献

本文的目的是确定周期dn = 2q的Ding - Helleseth - Martinsen (DHM)序列的p -进复杂度,其中q= 5 (mod 8)是素数。我们首先利用有限域𝔽q上的“高斯周期”和“二次高斯和”,以及在N范围内的值,来确定DHM序列的“进数”复杂度。
The purpose of this paper is to determine thep‐adic complexity of the Ding‐Helleseth‐Martinsen (DHM) sequences with periodN= 2q, whereq= 5 (mod 8) is a prime number. We firstly use thep‐adic exponential valuation, cyclotomic numbers of order four, “Gauss periods” and “quadratic Gauss sums” on finite field 𝔽q, and valued in ℤN, to determine thep‐adic complexity of the DHM sequences.