您当前的位置:
首页 >
文章列表页 >
An Efficient Algorithm for Determining the k-Error Linear Complexity of Periodic Sequences
更新时间:2025-07-16
    • An Efficient Algorithm for Determining the k-Error Linear Complexity of Periodic Sequences

    • Acta Electronica Sinica   Vol. 32, Issue 5, Pages: 705-708(2004)
    • CLC: TN918.1
    • Published:2004

    移动端阅览

  • WEI Shi-min. An Efficient Algorithm for Determining the k-Error Linear Complexity of Periodic Sequences[J]. Acta Electronica Sinica, 2004, 32(5): 705-708. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

902

下载量

3

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

The 4-Error Linear Complexity of Binary Periodic Sequences
The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)
A Relationship Between Autocorrelation and Linear Complexity
A New Algorithm for the Sphere Complexity of Periodic Sequence
Pseudo-Randomness of a Class of Sequences with Ideal Autocorrelation

Related Author

QI Wen-feng
PI Fei
WANG Jin-ling
WANG Hui-juan
GAO Jun-tao
HU Yu-pu
LI Xue-lian
WEI Shi-min

Related Institution

State Key Laboratory of Information SecurityChinese Academy of SciencesBeijing 100190China
Department of Applied MathematicsInformation Engineering InstituteInformation Engineering UniversityZhengzhouHenan 450002China
State Key Laboratory of Information Security,Chinese Academy of Sciences
Department of Applied Mathematics,Information Engineering Institute,Information Engineering University
Mathematics Department, Zhengzhou University
0