AI Chat AI Image Generator AI Video Text to Speech

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

12/11/2017

∙

by Vladimir Edemskiy, et al.

∙

∙

In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences.

page 1

page 2

page 3

page 4

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...

0 Chenhuang Wu, et al. ∙

research

∙ 04/30/2019

On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequenc...

0 Minghui Yang, et al. ∙

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 ...

0 Vladimir Edemskiy, et al. ∙

research

∙ 11/23/2018

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

We investigate the k-error linear complexity over F_p of binary sequence...

0 Vladimir Edemskiy, et al. ∙

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...

0 Zhifan Ye, et al. ∙

research

∙ 10/18/2018

Using Pseudocodewords to Transmit Information

The linear programming decoder will occasionally output fractional-value...

0 Nathan Axvig, et al. ∙

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...

0 Minghui Yang, et al. ∙