An Efficient Algorithm for Computing the k-error Linear Complexity Spectrum of Periodic Sequences

摘要：

　　An efficient algorithm for computing the k-error linear complexity spectrum of a q-ary sequence s with period 2 pn is presented,where q is an odd prime and a primitive root modulo p2.The algorithm generalizes both the Wei-Xiao-Chen and the Wei algorithms,The new algorithm can compute the k-error linear complexity spectrum of s using at most 4n+1 steps.

关键词： periodic sequence k-error linear complexity spectrum algorithm

作者: Ma-Lingyong Cao hao

作者单位: Department of Computer and Information Science, City College of Dong Guan University ofTechnology ,D College of Science Anhui Science & Technology University Fengyang,Anhui,China

会议类型: 国际会议

会议名称: 2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

会议地点: 西安

会议语种:英文

页码: 1726-1731

在线出版日期: 2012-08-24（万方平台首次上网日期，不代表论文的发表时间）