On error linear complexity of new generalized cyclotomic binary sequences of period p^2

11/16/2017
by   Chenhuang Wu, et al.
0

We consider the k-error linear complexity of a new binary sequence of period p^2, proposed in the recent paper "New generalized cyclotomic binary sequences of period p^2", by Z. Xiao et al., who calculated the linear complexity of the sequences (Designs, Codes and Cryptography, 2017, https://doi.org/10.1007/s10623-017-0408-7). More exactly, we determine the values of k-error linear complexity over F_2 for almost k>0 in terms of the theory of Fermat quotients. Results indicate that such sequences have good stability.

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/24/2018

Linear complexity of generalized cyclotomic sequences of period 2p^m

In this paper, we construct two generalized cyclotomic binary sequences ...
research
10/10/2019

On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p

We consider the k-error linear complexity of binary sequences derived fr...
research
03/01/2019

Note about the linear complexity of new generalized cyclotomic binary sequences of period 2p^n

This paper examines the linear complexity of new generalized cyclotomic ...
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
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
03/28/2019

On the stability of periodic binary sequences with zone restriction

Traditional global stability measure for sequences is hard to determine ...

Please sign up or login with your details

Forgot password? Click here to reset