Based on. Kaida-Uehara-Imamura algorithm, we presented a fast algorithm for determining the m-tight error linear com- plexity of sequences over GF(pm) with ...
The algorithm is de- rived from the algorithm for the k-error linear complex- ity of sequences over GF(pm) with period pn, where p is a prime [4]. The ...
Sep 21, 2011 · An efficient algorithm for computing m-tight error linear complexity is derived from the algorithm for computing k-error linear complexity of ...
The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, ...
An efficient algorithm for computing m-tight error linear complexity of binary sequences with period pn is given, where p is a prime and 2 is a primitive ...
Finally,an efficient algorithm for computing m-tight error linear complexity of sequences with period 2pn over GF(q) is given,where p and q are odd primes and q ...
A fast algorithm is presented for determining the linear complexity of a sequence with period p/sup n/ over GF (q), where p is an odd prime, and where q is a ...
An algorithm is given for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime. The algorithm is derived by the.
Missing: Tight | Show results with:Tight
The new algorithm generalizes the algorithm for computing the linear complexity of a sequence with period qn over GF(q) and the algorithm for computing one of a ...
Sep 21, 2011 · An efficient algorithm for computing $m$-tight error linear complexity is derived from the algorithm for computing $k$-error linear complexity ...