Skip to main content
SpringerLink
Log in

One-Error Linear Complexity over F p of Sidelnikov 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

Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over F p of Sidelnikov sequences of length p m – 1 is \((\frac{p+1}{2})^{m} -1\), which is much less than its (zero-error) linear complexity.

This work was supported by Korea Research Foundation Grant (KRF-2003-041-D00417).

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. Sidelnikov, V.M.: Some k-valued pseudo-random and nearly equidistant codes. Probl. Pered. Inform. 5(1), 16–22 (1969)

    MathSciNet  Google Scholar 

  2. Lempel, A., Cohn, M., Eastman, W.L.: A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inform. Theory 23(1), 38–42 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  3. Sarwate, D.V.: Comments on A Class of Balanced Binary Sequences with Optimal Autocorrelation Properties. IEEE Trans. Inform. Theory 24(1), 128–129 (1978)

    Article  Google Scholar 

  4. No, J.-S., Chung, H., Song, H.-Y., Yang, K., Lee, J.-D., Helleseth, T.: New Construction for Binary Sequences of period p m − 1 with Optimal Autocorrelation Using (z + 1)d + az d + b. IEEE Trans. Inform. Theory 47(4), 1638–1644 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Helleseth, T., Yang, K.: On binary sequences of period p m − 1 with optimal autocorrelation. In: Proc. 2001 Conf. Sequences and Their Applications (SETA 2001), Bergen, Norway, May 13-17, pp. 29–30 (2001)

    Google Scholar 

  6. Kyureghyan, G.M., Pott, A.: On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences. Design, Codes and Cryptography 29, 149–164 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Helleseth, T., Kim, S.-H., No, J.-S.: Linear complexity over F p and trace representation of Lempel-Cohn-Eastman sequences. IEEE Trans. Inform. Theory 49(6), 1522–1548 (2003)

    Article  MathSciNet  Google Scholar 

  8. Helleseth, T., Maas, M., Mathiassen, J.E., Segers, T.: Linear complexity over F p of Sidelnikov sequences. IEEE Trans. Inform. Theory 50(10), 2468–2472 (2004)

    Article  MathSciNet  Google Scholar 

  9. Stamp, M., Martin, C.F.: An algorithm for the k-linear complexity of binary sequences with period 2n. IEEE Trans. Inform. Theory 39(4), 1398–1401 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  10. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland Mathematical Library 55. North-Holland/Elsevier, Amsterdam (1998)

    Google Scholar 

  11. Blahut, R.E.: Transform techniques for error control codes. IBM J. Res. Develop. 23, 299–315 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, New York (1983)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SAMSUNG ELECTRONICS CO., LTD., Dong Suwon, P.O.BOX-105, 416 Maetan-3Dong, Paldal-Gu, Suwon-City, Gyeonggi-Do, 442-600, Korea

    Yu-Chang Eun

  2. Center for Information Technology of Yonsei University, Coding and Information Theory Lab, Department of Electrical and Electronics Engineering, Yonsei University, 134 Shinchon-dong Seodaemun-gu, Seoul, 120-749, Korea

    Hong-Yeop Song

  3. Faculty of Mathematics, Otto-von-Guericke University, Magdeburg, Postfach 4120, Magdeburg, 39016, Germany

    Gohar M. Kyureghyan

Authors
  1. Yu-Chang Eun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hong-Yeop Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gohar M. Kyureghyan
    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

Eun, YC., Song, HY., Kyureghyan, G.M. (2005). One-Error Linear Complexity over F p of Sidelnikov 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_9

Download citation

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

  • 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