Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On the Profile of the k-Error Linear Complexity and the Zero Sum Property for Sequences over GF(p m) with Period p n

  • Conference paper
Sequences and their Applications

Part of the book series: Discrete Mathematics and Theoretical Computer Science ((DISCMATH))

Summary

The k-error linear complexity of periodic sequences is a natural generalization of the linear complexity which is one of important measures for pseudorandom sequences. In this paper, we give a relation between the minimum decrease and the zero sum property for sequences over GF(p m) with period p n, where p is a prime. Moreover the parity of the decrease set in case of binary sequences with period 2 n is shown.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Massey J.L. (1969) Shift register synthesis and BCH decoding. IEEE Trans, on Information Theory. IT-15, 122–127.

    Article  MathSciNet  MATH  Google Scholar 

  2. Stamp M., Martin C.F. (1993) An algorithm for the terror linear complexity of binary sequences with period 2n. IEEE Trans, on Information Theory. 39, 1398–1401.

    Article  MathSciNet  MATH  Google Scholar 

  3. Ding C., Xiao G., Shan W. (1991) The Stability Theory of Stream Ciphers. Lecture Notes in Compute Science, 561, Springer-Verlag.

    Google Scholar 

  4. Kaida T., Uehara S., Imamura K. (1999) An algorithm for the k-error linear complexity of sequences over GF(pm) with period p n, p a prime. Information and Computation. 151, Academic Press, 134–147.

    Google Scholar 

  5. Kaida T., Uehara S., Imamura K. (1999) A new algorithm for the k-error linear complexity of sequences over GF(p m) with period p n. Sequences and their Applications. Springer-Verlag, 284–296.

    Chapter  Google Scholar 

  6. Uehara S., Imamura K. (1996) Linear complexity of periodic sequences obtained from GF(q) sequences with period q n-1 by one-symbol insertion. IEICE Trans, on Fundamentals. 79-A, 1739–1740.

    Google Scholar 

  7. Kurosawa K., Sato F., Sakata T., Kishimoto W. (2000) A relationship between linear complexity and k-error linear complexity. IEEE Trans, on Information Theory. 46, 694–698.

    Article  MathSciNet  MATH  Google Scholar 

  8. Massey J.L., Costello D.J., Justesen J. (1973) Polynomial weight and code construction, IEEE Trans, on Information Theory. IT-19, 101–110.

    Article  MathSciNet  Google Scholar 

  9. Chan A.H., Games R.A., Key E.L. (1982) On the complexities of de Bruijn sequences, Journal of Combinatorial Theory, Series A, 33, 233–246.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Takayasu Kaida

  2. The University of Kitakyushu, Wakamatsu, Kitakyushu, 808-0135, Japan

    Satoshi Uehara

  3. Kyushu Institute of Technology, Iizuka, Fukuoka, 820-8502, Japan

    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

Editors and Affiliations

  1. Department of Informatics, University of Bergen, N-5020, Bergen, Norway

    T. Helleseth

  2. Communication Sciences Institute, Department of Electrical Engineering Systems, University of Southern California, 90089-2565, Los Angeles, CA, USA

    P. V. Kumar

  3. Department of Electronic and Electrical Engineering, Pohang University of Science and Technology (POSTECH), 790-784, Pohang, Kyungbuk, Korea

    K. Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag London

About this paper

Cite this paper

Kaida, T., Uehara, S., Imamura, K. (2002). 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: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0673-9_16

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-529-8

  • Online ISBN: 978-1-4471-0673-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation