An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
classification
💻 cs.CR
keywords
algorithmcomplexityk-errorlinearperiodsequencecomputingcost
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.