An algorithm for the ๐ฆ-error linear complexity of a sequence with period 2๐๐ over GF( ๐)
Jianqin Zhou ยท 2007
We first optimize the structure of theWei-Xiao-Chenalgorithm for the linear complexity of sequences overGF(q)with periodN = 2pn,wherepandqare odd primes, andqis a primitive root( mod p2). Then the union cost is used, so that an efficient algorithm for computing k-error linear complexity of a sequence with period2pn,overGF(q)is derived, wherepandqare odd primes, andqis a primitive root of modulop2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.