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!
|
| _version_ | 1841539435273912320 |
|---|---|
| author | Zhixiong CHEN Chenhuang WU |
| author_facet | Zhixiong CHEN Chenhuang WU |
| author_sort | Zhixiong CHEN |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-7fa7def8889748859764ee9ebc40301a |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2019-02-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-7fa7def8889748859764ee9ebc40301a2025-01-14T07:16:25ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2019-02-014019720659725422k-error linear complexity of binary cyclotomic generatorsZhixiong CHENChenhuang WUIn 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019034/Legendre sequenceDing-Helleseth-Lam sequenceHall's sextic residue sequencek-error linear complexitydiscrete Fourier transform |
| spellingShingle | Zhixiong CHEN Chenhuang WU k-error linear complexity of binary cyclotomic generators Tongxin xuebao Legendre sequence Ding-Helleseth-Lam sequence Hall's sextic residue sequence k-error linear complexity discrete Fourier transform |
| title | k-error linear complexity of binary cyclotomic generators |
| title_full | k-error linear complexity of binary cyclotomic generators |
| title_fullStr | k-error linear complexity of binary cyclotomic generators |
| title_full_unstemmed | k-error linear complexity of binary cyclotomic generators |
| title_short | k-error linear complexity of binary cyclotomic generators |
| title_sort | k error linear complexity of binary cyclotomic generators |
| topic | Legendre sequence Ding-Helleseth-Lam sequence Hall's sextic residue sequence k-error linear complexity discrete Fourier transform |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019034/ |
| work_keys_str_mv | AT zhixiongchen kerrorlinearcomplexityofbinarycyclotomicgenerators AT chenhuangwu kerrorlinearcomplexityofbinarycyclotomicgenerators |