您当前的位置:
首页 >
文章列表页 >
A New Algorithm for the Sphere Complexity of Periodic Sequence
更新时间:2025-07-16
    • A New Algorithm for the Sphere Complexity of Periodic Sequence

    • Acta Electronica Sinica   Vol. 31, Issue 8, Pages: 1263-1265(2003)
    • CLC: TN918.1
    • Published:2003

    移动端阅览

  • WEI Shi-min, CHEN Zhong, DUAN Yun-suo. A New Algorithm for the Sphere Complexity of Periodic Sequence[J]. Acta Electronica Sinica, 2003, 31(8): 1263-1265. DOI:

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

0

Views

872

下载量

1

CSCD

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

Related Articles

The Linear Complexity of the Generalized Self-Shrinking Generator on GF(q)
An Efficient Algorithm for Determining the k-Error Linear Complexity of Periodic Sequences
Pseudo-Randomness of a Class of Sequences with Ideal Autocorrelation
Research on Pseudo Sparse-Sequences

Related Author

WANG Jin-ling
WANG Hui-juan
WEI Shi-min
HU Yu-pu
YANG Bo
Xiao Guo-zhen
WEI Shi-min
HU Yu-pu

Related Institution

Mathematics Department, Zhengzhou University
淮北煤炭师范学院计算机科学与技术系安徽淮北
淮北煤炭师范学院计算机科学与技术系
ISPIISN National Key Lab.Xidian UniversityXi'anShaanxi 710071China
ISPI,ISN National Key Lab.,Xidian University
0