k-error linear complexity of binary cyclotomic generators
In terms of the discrete Fourier transforms,the k-error linear complexities over F<sub>2</sub>were discussed for Legendre,Ding-Helleseth-Lam,and Hall's sextic residue sequences of odd prime period p.More precisely,the 1-error linear complexities of these sequences were determined.Th...
Saved in:
Main Authors: | Zhixiong CHEN, Chenhuang WU |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2019-02-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019034/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
k-error linear complexity of q-ary sequence of period p<sup>2</sup>
by: Chenhuang WU, et al.
Published: (2019-12-01) -
On the Linear Complexity of Generalized Cyclotomic Sequences with Odd Period
by: V. A. Edemskiy
Published: (2024-07-01) -
Constructions of perfect Gaussian integer sequences of odd prime length
by: Yubo LI, et al.
Published: (2018-11-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) -
On the number of residues of certain second-order linear recurrences
by: Accossato, Federico, et al.
Published: (2024-11-01)