An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
<|reference_start|>An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q): 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 presented, where p and q are odd primes, and q is a primitive root of modulo p2.<|reference_end|>
@article{zhou2005an,
    title={An algorithm for the k-error linear complexity of a sequence with period
  2pn over GF(q)},
    author={Jianqin Zhou, Xirong Xu},
    journal={arXiv preprint arXiv:cs/0512039},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0512039},
    primaryClass={cs.CR}
}