An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$

Details An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$ An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$

2011-09-21

arxiv.org/abs/1109.4459v1

Computer Science

Cryptography and Security

Scientific paper

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, $k$-error linear complexity, the minimum error and the $k$-error linear complexity profile, the notion of $m$-tight error linear complexity is presented. An efficient algorithm for computing $m$-tight error linear complexity is derived from the algorithm for computing $k$-error linear complexity of sequences over GF($p^{m}$) with period $p^n$, where $p$ is a prime. The validity of the algorithm is shown. The algorithm is also realized with C language, and an example is presented to illustrate the algorithm.

Affiliated with

Also associated with

No associations

Rating

An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$ 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 Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm for Computing $m$-Tight Error Linear Complexity of Sequences over $GF(p^{m})$ with Period $p^{m}$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256926