An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)

Details An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q) An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)

2005-12-10

arxiv.org/abs/cs/0512039v1

Computer Science

Cryptography and Security

6 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-557148