k-error linear complexity of q-ary sequence of period p<sup>2</sup>
Based on element statistics in a matrix,a new efficient computing method for computing the k-error linear complexity of q-ary sequence of period p<sup>2</sup>was proposed,where p,q were odd primes and q modulo p<sup>2</sup>was primitive.A gener...
Saved in:
Main Authors: | Chenhuang WU, Chunxiang XU, Xiaoni DU |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2019-12-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2019230/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
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) -
k-error linear complexity of binary cyclotomic generators
by: Zhixiong CHEN, et al.
Published: (2019-02-01) -
Number of sequences with given linear complexity profiles
by: LIU Xun-shou, et al.
Published: (2006-01-01) -
Computing on the joint quadratic complexity of multiple periodic sequences
by: Li-hua DONG, et al.
Published: (2012-06-01) -
Research on linear approximations of simplified Trivium
by: Meng MA, et al.
Published: (2016-06-01)