Skip to main content
Springer Nature Link
Log in

On the error linear complexity spectrum of \(p^{n}\)-periodic binary sequences

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

An Erratum to this article was published on 27 April 2014

Abstract

The error linear complexity spectrum of a periodic sequence is defined to be the ordered list of \(k\)-error linear complexities of the sequence. In this paper, we present an algorithm which computes the error linear complexity spectrum for binary sequences with period \(p^{n}\), where \(p\) is an odd prime and \(2\) is a primitive root modulo \(p^{2}\).

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers Lecture Notes in Computer Science, 561. Springer, Berlin (1991)

  2. Games, R.A., Chan, A.H.: A fast algorithm for determining the linear complexity of a binary sequence with period \(2^{n}\). IEEE Trans. Inform. Theory IT–29(1), 144–146 (1983)

    Article  MathSciNet  Google Scholar 

  3. Lauder, A., Paterson, K.: Computing the error linear complexity spectrum of a binary sequence of period \(2^{n}\). IEEE Trans. Inform. Theory 49(1), 273–280 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Meidl, W.: How many bits have to be changed to decrease the linear complexity? Des. Codes Cryptogr. 33, 109–122 (2004)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Wei, S., Chen, Z., Xiao, G.: A fast algorithm for the \(k\)-error linear complexity of a binary sequence. In: 2001 International Conferences on Info-tech and Info-net Proceedings (ICII 2001-Beijing), vol. 5, pp. 152–157 (2001)

  7. Xiao, G., Wei, S., Lam, K.Y., Imamura, K.: A fast algorithm for determining the linear complexity of a sequence with period \(p^{n}\) over GF(q). IEEE Trans. Inform. Theory 46(6), 2203–2206 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Anhui Agricultural University, Hefei, 230036, Anhui, People’s Republic of China

    Miao Tang

  2. School of Mathematics, Hefei University of Technology, Hefei, 230009, Anhui, People’s Republic of China

    Shixin Zhu

Authors
  1. Miao Tang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Shixin Zhu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Miao Tang.

Additional information

This research is supported by the National Natural Science Foundation of China (No. 60973125) and the Natural Science Foundation of Anhui Province (No. 1208085MA14).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tang, M., Zhu, S. On the error linear complexity spectrum of \(p^{n}\)-periodic binary sequences. AAECC 24, 497–505 (2013). https://doi.org/10.1007/s00200-013-0210-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-013-0210-3

Keywords