About the k-Error Linear Complexity over F_p of sequences of length 2p with optimal three-level autocorrelation

11/23/2018
by   Vladimir Edemskiy, et al.
0

We investigate the k-error linear complexity over F_p of binary sequences of length 2p with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method presented by Ding et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2017

The linear complexity of new binary cyclotomic sequences of period p^n

In this paper, we determine the linear complexity of a class of new bina...
research
08/26/2021

Binary sequences with length n and nonlinear complexity not less than n/2

In this paper, the construction of finite-length binary sequences whose ...
research
06/22/2023

On boundedness of zeros of the independence polynomial of tori

We study boundedness of zeros of the independence polynomial of tori for...
research
05/07/2020

Binary sequences derived from differences of consecutive quadratic residues

For a prime p> 5 let q_0,q_1,...,q_(p-3)/2 be the quadratic residues mod...
research
09/04/2019

Complexity of controlled bad sequences over finite powersets of N^k

We provide lower and upper bounds for the length of controlled bad seque...
research
05/05/2018

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

Recently, a class of binary sequences with optimal autocorrelation magni...
research
10/26/2022

A Nonlinear Sum of Squares Search for CAZAC Sequences

We report on a search for CAZAC sequences by using nonlinear sum of squa...

Please sign up or login with your details

Forgot password? Click here to reset