Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products

12/13/2019
by   Ming Yan, et al.
0

This paper contributes to compute 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2020

The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure

The autocorrelation values of two classes of binary sequences are shown ...
research
06/10/2021

On the 4-adic complexity of the two-prime quaternary generator

R. Hofer and A. Winterhof proved that the 2-adic complexity of the two-p...
research
02/24/2021

Further results on the 2-adic complexity of a class of balanced generalized cyclotomic sequences

In this paper, the 2-adic complexity of a class of balanced Whiteman gen...
research
07/08/2021

On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation

In this paper, we determine the 4-adic complexity of the balanced quater...
research
11/22/2017

Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes

A family of quaternary sequences over Z4 is defined based on the Ding-He...
research
02/22/2018

Linear complexity of Ding-Helleseth generalized cyclotomic sequences of order eight

During the last two decades, many kinds of periodic sequences with good ...
research
10/09/2019

Implementation of irreducible Sobol sequences in prime power bases

We present different implementations for the irreducible Sobol (IS) sequ...

Please sign up or login with your details

Forgot password? Click here to reset