Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (5): 80-82.

• 网络、通信、安全 • Previous Articles     Next Articles

Fast algorithm for determining k-error linear complexity profile of special period sequence

MA Lingyong1,WEI Shimin2   

  1. 1.Department of Computer and Information Sciences,City College of Dongguan University of Technology,Dongguan,Guangdong 523106,China
    2.Department of Mathematics,Huaibei Coal Normal College,Huaibei,Anhui 235000,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-02-11 Published:2011-02-11

特殊周期序列k-错线性复杂度曲线的快速算法

马陵勇1,魏仕民2   

  1. 1.东莞理工学院城市学院 计算机与信息科学系,广东 东莞 523106
    2.淮北煤炭师范学院 数学系,安徽 淮北 235000

Abstract: An efficient algorithm for computing the k-error linear complexity profile of a binary sequence with a period 2pn is presented,where 2 is a primitive root of modulo p2.This algorithm generalizes the algorithms,which compute the linear complexity and k-error linear complexity of a binary sequence with a period 2pn.

Key words: periodic sequence, k-error linear complexity profile, fast algorithm

摘要: 提出周期为2pn的二元序列k-错线性复杂度曲线的一个快速算法,这里2是模p2的一个本原根,该算法推广了计算周期2pn的二元序列线性复杂度和k-错线性复杂度的快速算法。

关键词: 关键词, 周期序列, k-错线性复杂度曲线, 快速算法