您当前的位置:
首页 >
文章列表页 >
The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)
更新时间:2025-07-16
    • The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)

    • Acta Electronica Sinica   Vol. 39, Issue 2, Pages: 414-418(2011)
    • CLC: TN918.1
    • Published:2011

    移动端阅览

  • WANG Hui-juan, WANG Jin-ling. The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)[J]. Acta Electronica Sinica, 2011, 39(2): 414-418. DOI:

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

0

Views

1000

下载量

1

CSCD

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

Related Articles

An Efficient Algorithm for Determining the k-Error Linear Complexity of Periodic Sequences
A New Algorithm for the Sphere Complexity of Periodic Sequence
Pseudo-Randomness of a Class of Sequences with Ideal Autocorrelation
Research on Pseudo Sparse-Sequences

Related Author

WEI Shi-min
WEI Shi-min
CHEN Zhong
DUAN Yun-suo
HU Yu-pu
YANG Bo
HU Yu-pu
WEI Shi-min

Related Institution

淮北煤炭师范学院计算机科学与技术系
淮北煤炭师范学院计算机科学与技术系安徽淮北
Department of Computer Science and Technique,Peking University
Department of Computer Science and TechniqueHuaibe Coal Normal CollegeAnhui Huaibei 235000China
Department of Computer Science and TechniquePeking UniversityBeijing 100871China
0