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

03/01/2019
by   Vladimir Edemskiy, et al.
0

This paper examines the linear complexity of new generalized cyclotomic binary sequences of period 2p^n recently proposed by Yi Ouang et al. (arXiv:1808.08019v1 [cs.IT] 24 Aug 2018). We generalize results obtained by them and discuss author's conjecture of this paper.

READ FULL TEXT
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
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
12/24/2017

A note on a conjecture of new binary cyclotomic sequences of length p^n

Recently, a conjecture on the linear complexity of a new class of genera...
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
05/23/2021

Determination of the Autocorrelation Distribution and 2-Adic Complexity of Generalized Cyclotomic Binary Sequences of Order 2 with Period pq

The generalized cyclotomic binary sequences S=S(a, b, c) with period n=p...
research
06/14/2016

A Note on the Period Enforcer Algorithm for Self-Suspending Tasks

The period enforcer algorithm for self-suspending real-time tasks is a t...

Please sign up or login with your details

Forgot password? Click here to reset