# Computation of the *k*-error linear complexity of binary sequences with period 2^{n}

Conference paper

First Online:

## Abstract

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 2^{n} (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.

## Preview

Unable to display preview. Download preview PDF.

## References

- 1.M. Stamp and C.F. Martin, “An algorithm for the
*k*-error linear complexity of binary sequences with period 2^{n}”,*IEEE Trans. Inform. Theory*, vol. 39, pp. 1398–1401, July 1993.CrossRefGoogle Scholar - 2.C. Ding, G. Xiao and W. Shan,
*The Stability Theory of Stream Ciphers*, Lecture Notes in Computer Science 561, Springer-Verlag, Berlin, 1991.Google Scholar - 3.R.A. Games and A.H. Chan, “A fast algorithm for determining the complexity of a pseudo-random sequences with period 2
^{n}”,*IEEE Trans. Inform. Theory*, vol. IT-29, pp. 144–146, Jan. 1983.CrossRefGoogle Scholar - 4.K. Imamura and T. Moriuchi, “A fast algorithm for determining the linear complexity of a
*p*-ary sequence with period*p*^{n},*p*a prime”, (in Japanese),*IEICE Technical Rept.*, vol. IT93-77, pp. 73–77, Dec. 1993.Google Scholar - 5.T. Kaida, S. Uehara and K. Imamura, “An algorithm for the
*k*-error linear complexity of sequences over*GF*(3) with period 3^{n}”,*Proc. 1996 Int'l Symp. Inform. Theory and Its Applications*, pp. 155–158, Sep. 1996.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1996