On the $ k $-error linear complexity of binary sequences of periods $ p^n $ from new cyclotomy

On the $ k $-error linear complexity of binary sequences of periods $ p^n $ from new cyclotomy

In this paper, we study the $ k $-error linear complexity of binary sequences with periods $ p^n $, which are derived from new generalized cyclotomic classes modulo a power of an odd prime $ p $. We establish a recursive relation and then estimate the $ k $-error linear complexity of the binary sequ...

Full description

Bibliographic Details
Main Authors: Vladimir Edemskiy, Chenhuang Wu
Format: Article
Language:English
Published: AIMS Press 2022-02-01
Series:AIMS Mathematics
Subjects:
k-error linear complexity
binary sequences
cyclotomy
stream cipher
cryptography
Online Access:https://www.aimspress.com/article/doi/10.3934/math.2022446?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/math.2022446?viewType=HTML

Similar Items