Skip to main content
SpringerLink
Log in
Book cover

Annual Asian Computing Science Conference

ASIAN 1996: Concurrency and Parallelism, Programming, Networking, and Security pp 182–191Cite as

Computation of the k-error linear complexity of binary sequences with period 2n

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1179))

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 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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

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 2n”, IEEE Trans. Inform. Theory, vol. 39, pp. 1398–1401, July 1993.

    Article  Google 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 2n”, IEEE Trans. Inform. Theory, vol. IT-29, pp. 144–146, Jan. 1983.

    Article  Google 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 3n”, Proc. 1996 Int'l Symp. Inform. Theory and Its Applications, pp. 155–158, Sep. 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Yatsushiro National College of Technology, Yatsushiro, 866, Kumamoto, Japan

    Takayasu Kaida

  2. Kyushu Institute of Technology, Iizuka, 820, Fukuoka, Japan

    Satoshi Uehara & Kyoki Imamura

Authors
  1. Takayasu Kaida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoshi Uehara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kyoki Imamura
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joxan Jaffar Roland H. C. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaida, T., Uehara, S., Imamura, K. (1996). Computation of the k-error linear complexity of binary sequences with period 2n . In: Jaffar, J., Yap, R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027791

Download citation

  • DOI: https://doi.org/10.1007/BFb0027791

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62031-0

  • Online ISBN: 978-3-540-49626-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation