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-错线性复杂度曲线, 快速算法