An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)

摘要：

We first optimize the structure of the Wei-XiaoChen algorithm for the linear complexity of sequences over GF(q) with period N =2pn, where p and q are odd primes,and q is a primitive root ( mod p2). Then the union cost is used, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2pn over GF(q) is derived, where p and q are odd primes, and q is a primitive root of modulo p2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.

关键词： Periodic sequence linear complexity k-error linear complexity

作者: Jianqin Zhou

作者单位: Department of Computer Science Anhui University of Technology Maanshan, 243002 China

会议类型: 国际会议

会议名称: 第三届信号设计及其在通信中的应用国际会议(Proceedings of 2007 International Workshop on Signal Design and Its Applications in Communications IWSDA07)

会议地点: 成都

会议语种:英文

页码: 104-108

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