Skip to main content
Springer Nature Link
Log in

Expected Value of the Linear Complexity of Two-Dimensional Binary 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

In this work, based on the technique of multi-continued fractions [6,7,8], we study the normalized expected value e(2,n) of the linear complexity of binary sequences of dimension 2. As a result, e(2,n) is determined, and moreover, it is found that \(e(2,n) \rightarrow \frac{2}{3}\) as n goes into infinity.

This work is partly supported by NSFC (Grant No. 60173016), and the National 973 Project (Grant No. 1999035804).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Niederreiter, H.: Some computable complexity measures for binary sequences. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and their applications, pp. 67–78. Springer, London (1999)

    Google Scholar 

  2. Rueppel, R.A.: Analysis and Design of Stream ciphers. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  3. Dai, Z.D., Yang, J.H.: Linear complexity of periodically repeated random sequences. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 168–175. Springer, Heidelberg (1991)

    Google Scholar 

  4. Meidl, W., Niderreiter, H.: The expected value of joint linear complexity of periodic multisequences. Journal of Complexity 19, 61–72 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Xing, C.: Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields. Journal of Complexity 16, 661–675 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dai, Z., Wang, K., Ye, D.: m-Continued Fraction Expansions of Multi-Laurent Series. Advances In Mathematics (China) 33(2), 246–248 (2004)

    Google Scholar 

  7. Dai, Z., Wang, K., Ye, D.: Multidimensional Continued Fraction and Rational Approximation, http://arxiv.org/abs/math.NT/0401141

  8. Dai, Z., Feng, X., Yang, J.: Multi-continued fraction algorithm and generalized B-M algorithm over F 2. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 339–354. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Dai, Z., Feng, X.: Multi-continued fraction algorithm and generalized B-M algorithm over F 2. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 113–117. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. State Key Laboratory of Information Security, (Graduate School of Chinese Academy of Sciences), Beijing, 100049

    Xiutao Feng & Zongduo Dai

Authors
  1. Xiutao Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zongduo Dai
    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

Feng, X., Dai, Z. (2005). Expected Value of the Linear Complexity of Two-Dimensional Binary 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_6

Download citation

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

  • 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