The k-error linear complexity(k-LC) of sequences is a very natural and useful generalization of the linear complexity(LC) which has been conveniently used as a measure of unpredictability of pseudorandom sequences, i.e., difficulty in recovering more of a sequence from a short, captured segment. However the effective method for computing the k-LC has been known only for binary sequences with period 2n (Stamp and Martin, 1993). This paper gives an alternative derivation of the Stamp-Martin algorithm. Our method can compute not only k-LC but also an error vector with Hamming weight ≤ k which gives the k-LC.
CITATION STYLE
Kaida, T., Uehara, S., & Imamura, K. (1996). Computation of the k-error linear complexity of binary sequences with period 2n. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1179, pp. 182–191). Springer Verlag. https://doi.org/10.1007/bfb0027791
Mendeley helps you to discover research relevant for your work.