journal6 ›› 2013, Vol. 34 ›› Issue (6): 41-46.DOI: 10.3969/j.issn.1007-2985.2013.06.012

• Information and communication • Previous Articles     Next Articles

On k-Error Linear Complexity of pn-Periodic Sequences over GF(q)

 ZHOU  Jian-Qin, OuYang-Kong-Li   

  1. (1.Computer Science School,Anhui University of Technology,Ma’anshan 243002,Anhui China;2.College of Telecommunication,Hangzhou Dianzi University,Hangzhou 310018,China)
  • Online:2013-11-25 Published:2014-01-02

Abstract: Error linear complexity of periodic sequences is an important indicator of the stability of the key stream.First,the algorithm for computing the k-error linear complexity of a sequence with a period pn over GF(q) is rewritten,and an efficient algorithm for m-tight error linear complexity of this sequence is given.Secondly,a method is given for computing an error vector which gives the k-error linear complexity.Here p is an odd prime and q is a primitive root modulus p2.

Key words: k-error linear complexity, m-tight linear complexity, error vector

WeChat e-book chaoxing Mobile QQ