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

08/24/2018
by   Yi Ouyang, et al.
0

In this paper, we construct two generalized cyclotomic binary sequences of period 2p^m based on the generalized cyclotomy and compute their linear complexity, showing that they are of high linear complexity when m≥ 2.

READ FULL TEXT
research
07/09/2018

Corrigendum to New Generalized Cyclotomic Binary Sequences of Period p^2

New generalized cyclotomic binary sequences of period p^2 are proposed i...
research
01/29/2020

A kind of quaternary sequences of period 2p^mq^n and their linear complexity

Sequences with high linear complexity have wide applications in cryptogr...
research
02/27/2018

Coding Theory using Linear Complexity of Finite Sequences

We define a metric on F_q^n using the linear complexity of finite sequen...
research
11/16/2017

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

We consider the k-error linear complexity of a new binary sequence of pe...
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
07/30/2020

Determination of 2-Adic Complexity of Generalized Binary Sequences of Order 2

The generalized binary sequences of order 2 have been used to construct ...
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 ...

Please sign up or login with your details

Forgot password? Click here to reset