1 research outputs found
An Algorithm for Computing -Tight Error Linear Complexity of Sequences over with Period
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, -error linear complexity, the minimum error and the -error
linear complexity profile, the notion of -tight error linear complexity is
presented. An efficient algorithm for computing -tight error linear
complexity is derived from the algorithm for computing -error linear
complexity of sequences over GF() with period , where 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