On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

04/11/2019
by   Lulu Zhang, et al.
0

We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM) binary sequences by using cyclotomic numbers of order four, "Gauss periods" and "quadratic Gauss sum" on finite field F_q and valued in Z_2^N-1 where q ≡ 5 8 is a prime number and N=2q is the period of the DHM sequences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2022

The 4-Adic Complexity of Interleaved Quaternary Sequences of Even Length with Optimal Autocorrelation

Su et al. proposed several new classes of quaternary sequences of even l...
research
11/24/2020

The 4-Adic Complexity of A Class of Quaternary Cyclotomic Sequences with Period 2p

In cryptography, we hope a sequence over ℤ_m with period N having larger...
research
09/07/2022

Quadratic sequences with prime power discriminators

The discriminator of an integer sequence s = (s(i))_i ≥ 0, introduced by...
research
03/01/2021

Linear Recurrences over a Finite Field with Exactly Two Periods

In this paper, we study the periodicity structure of finite field linear...
research
06/03/2019

A test against trend in random sequences

We study a modification of Kendall's tau-test, replacing his permutation...
research
08/14/2023

Sequences with identical autocorrelation spectra

Aperiodic autocorrelation measures the similarity between a finite-lengt...
research
09/19/2022

Natural Wave Numbers, Natural Wave Co-numbers, and the Computation of the Primes

The paper exploits an isomorphism between the natural numbers N and a sp...

Please sign up or login with your details

Forgot password? Click here to reset