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: | , |
|---|---|
| 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!
|
| Summary: | 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.Then,with some special restrictions of the order of 2 modulo p,partial results on their k-error linear complexities (k≥2) were proved. |
|---|---|
| ISSN: | 1000-436X |