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...
Main Authors: | Vladimir Edemskiy, Chenhuang Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
AIMS Press
2022-02-01
|
Series: | AIMS Mathematics |
Subjects: | |
Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2022446?viewType=HTML |
Similar Items
-
On the linear complexity of a new generalized cyclotomic sequence with length <sup>m</sup>over GF(h)
by: Long-fei LIU, et al.
Published: (2017-09-01) -
On the linear complexity of a new generalized cyclotomic sequence with length <sup>m</sup>over GF(h)
by: Long-fei LIU, et al.
Published: (2017-09-01) -
k-error linear complexity of q-ary sequence of period p<sup>2</sup>
by: Chenhuang WU, et al.
Published: (2019-12-01) -
k-error linear complexity of q-ary sequence of period p<sup>2</sup>
by: Chenhuang WU, et al.
Published: (2019-12-01) -
Autocorrelation Values of Generalized Cyclotomic Sequences with Period <i>p</i><sup><i>n</i>+1</sup>
by: Xiaolin Chen, et al.
Published: (2019-10-01)