An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
Cryptography and Security
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.cs/0512039,
title = {An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)},
author = {Jianqin Zhou and Xirong Xu},
journal= {arXiv preprint arXiv:cs/0512039},
year = {2007}
}
Comments
6 pages