Skip to main content
SpringerLink
Log in

On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences

  • Conference paper
Sequences and Their Applications - SETA 2004 (SETA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3486))

Included in the following conference series:

Abstract

The Lauder-Paterson algorithm gives the profile of the k-error linear complexity for a binary sequence with period 2n. In this paper a generalization of the Lauder-Paterson algorithm into a sequence over GF(p m) with period p n, where p is a prime and m, n are positive integers, is proposed. We discuss memory and computation complexities of proposed algorithm. Moreover numerical examples of profiles for balanced binary and ternary exponent periodic sequences, and proposed algorithm for a sequence over GF(3) with period 9(= 32) are given.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dai, Z., Imamura, K.: Linear Complexity for One-Symbol Substitution of a Periodic Sequence over GF(q). IEEE Trans. on Information Theory 44, 1328–1331 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ding, C., Shan, W., Xiao, G.: The Stability Theory of Stream Ciphers. LNCS, vol. 561. Springer, Heidelberg (1991)

    MATH  Google Scholar 

  3. Games, R., Chan, A.: A Fast Algorithm for Determining the Complexity of a Binary Sequence with Period 2n. IEEE Trans. on Information Theory IT-29, 144–146 (1983)

    Article  MathSciNet  Google Scholar 

  4. Kaida, T., Uehara, S., Imamura, K.: An Algorithm for the k-Error Linear Complexity of Sequences over GF(p m) with Period p n, p a Prime. Information and Computation 151, 134–147 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kaida, T., Uehara, S., Imamura, K.: A New Algorithm for the k-Error Linear Complexity of Sequences over GF(p m) with Period p n. In: Sequences and their Applications - Proceedings of SETA 1998, pp. 284–296. Springer, Heidelberg (1999)

    Google Scholar 

  6. Kaida, T., Uehara, S., Imamura, K.: On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m) with Period p n. In: Sequences and their Applications - Proceedings of SETA 2001, pp. 218–227. Springer, Heidelberg (2001)

    Google Scholar 

  7. Kaida, T.: A Typical Profile of the k-Error Linear Complexity for Balanced Binary Sequences with Period 2n. submitted to IEICE Trans. Fundamentals, Special Section of Cryptography and Information Security (January 2005)

    Google Scholar 

  8. Kurosawa, K., Sato, F., Sakata, T., Kishinoto, W.: A Relationship between Linear Complexity and k-Error Linear Complexity. IEEE Trans. on Information Theory 46, 694–698 (2000)

    Article  MATH  Google Scholar 

  9. Lauder, A.G.B., Paterson, K.G.: Computing the Error Linear Complexity Spectrum of a Binary Sequence of Period 2n. IEEE Trans. Inf. Theory 49, 273–280 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Stamp, M., Martin, C.: An Algorithm for the k-Error Linear Complexity of Binary Sequences with Period 2n. IEEE Trans. on Information Theory 39, 1398–1401 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  11. Uehara, S., Imamura, K.: Linear Complexity of Periodic Sequences Obtained from GF(q) Sequences with Period q n − 1 by One-Symbol Insertion. IEICE Trans. on Fundamentals E79-A, 1739–1740 (1996)

    Google Scholar 

  12. Uehara, S., Imamura, K.: Linear Complexity of Periodic Sequences Obtained from GF(p) Sequences with Period p n − 1 by One-Symbol Deletion. IEICE Trans. on Fundamentals E80-A, 1164–1166 (1997)

    Google Scholar 

  13. Uehara, S., Imamura, K., Kaida, T.: Value distribution of linear complexity for q-ary periodic sequences with period p n, p a prime. IEICE Trans. Fundamentals E80-A, 920–921 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and Electronic Engineering, Yatsushiro National College of Technology, Yatsushiro, Kumamoto, 866-8501, Japan

    Takayasu Kaida

Authors
  1. Takayasu Kaida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, PB 7803, 5020, Bergen, Norway

    Tor Helleseth

  2. University of Ilinois at Urbana-Champaign, 1406 West Green Street, IL 61801, Urbana, USA

    Dilip Sarwate

  3. Department of Electrical and Electronic Engineering, Yonsei University, 121-749, Seoul, Korea

    Hong-Yeop Song

  4. Dept. of Electronics and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    Kyeongcheol Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaida, T. (2005). On the Generalized Lauder-Paterson Algorithm and Profiles of the k-Error Linear Complexity for Exponent Periodic Sequences. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_10

Download citation

  • DOI: https://doi.org/10.1007/11423461_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26084-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation