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

11/24/2020
by   Shiyuan Qiang, et al.
0

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack of the rational approximation algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/13/2019

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

This paper contributes to compute 2-adic complexity of two classes of Di...
research
08/27/2020

Perfect linear complexity profile and Apwenian sequences

Sequences with perfect linear complexity profile were defined more than ...
research
04/14/2022

Wave-like behaviour in (0,1) binary sequences

This work presents a comprehensive study of the properties of finite (0,...
research
03/20/2020

An Efficiently Generated Family of Binary de Bruijn Sequences

We study how to generate binary de Bruijn sequences efficiently from the...
research
06/03/2019

A test against trend in random sequences

We study a modification of Kendall's tau-test, replacing his permutation...
research
06/24/2022

New Classes of Binary Sequences with High Merit Factor

The Merit Factor (MF) measure was first introduced by Golay in 1972. Seq...
research
02/23/2019

On Greedy Algorithms for Binary de Bruijn Sequences

We propose a general greedy algorithm for binary de Bruijn sequences, ca...

Please sign up or login with your details

Forgot password? Click here to reset