@article{Edemskiy2022, 
author = {Vladimir Edemskiy and Chenhuang Wu},
title = {On the    k-error linear complexity of binary sequences of periods        p    n   from new cyclotomy},
year = {2022},
journal = {AIMS Mathematics},
volume = {7},
number = {5},
pages = {7997-8011},
keywords = {k-error linear complexity, binary sequences, cyclotomy, stream cipher, cryptography},
url = {https://www.sciopen.com/article/10.3934/math.2022446},
doi = {10.3934/math.2022446},
abstract = {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 sequences with periods        p    n  , the results extend the case        p    2   that has been studied in an earlier work of Wu et al. at 2019. Our results show that the    k-error linear complexity of these sequences does not decrease dramatically for    k  <  (      p          n        −      p          n      −      1        )      /    2.}
}