Skip to main content
SpringerLink
Log in

The linear complexity of a class of binary sequences with period \(2p\)

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

Abstract

In this paper, we determine the linear complexity and minimal polynomial of a class of binary sequences with period \(2p\) constructed by Ding et al. (IEEE Trans Inform Theory 47(1):428–433, 2001). Our results show that this class of sequences have high linear complexity.

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

Access this article

Log in via an institution

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

References

  1. Bai, E., Liu, X., Xiao, G.: Linear complexity of new generalized cyclotomic sequences of order two of length \(pq\). IEEE Trans. Inf. Theory 51(5), 1849–1853 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cai, Y., Ding, C.: Binary sequences with optimal autocorrelation. Theoret. Comput. Sci. 410(24–25), 2316–2322 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  4. Ding, C., Helleseth, T.: New generalized cyclotomy and its applications. Finite Fields Appl. 4(2), 140–166 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ding, C., Helleseth, T.H., Martinsen, H.: New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inf. Theory 47(1), 428–433 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ding, C., Helleseth, T., Lam, K.Y.: Several classes of binary sequences with three-level autocorrelation. IEEE Trans. Inf. Theory 45(7), 2606–2612 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ding, C., Helleseth, T., Shan, W.: On the linear complexity of \(\mathit{L}\)egendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)

  8. Ding, C., Pei, D., Salomaa, A.: Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography. World Scientific Publishing Co., Inc., River Edge (1996)

    Book  MATH  Google Scholar 

  9. Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Springer, Berlin (1991)

    Book  MATH  Google Scholar 

  10. Du, X., Chen, Z.: Trace representation of binary generalized cyclotomic sequences with length \(p^{m}\). IEICE Trans. Fund. Electron. Commun. Comput. Sci. 94(2), 761–765 (2011)

    Article  Google Scholar 

  11. Edemskiy, V.: About computation of the linear complexity of generalized cyclotomic sequences with period \(p^{n+1}\). Des. Codes Crypt. 61(3), 251–260 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  12. Golomb, S.W., Gong, G.: Signal Design for Good Correlation for Wireless Communication. Cryptography and Radar. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  13. Golomb, S.W., Welch, L.R., Goldstein, R.M., Hales, A.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills, CA (1982)

    Google Scholar 

  14. Ke, P., Zhang, J., Zhang, S.: On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^{m}\). Des. Codes Crypt. 67(3), 325–339 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kim, Y.J., Song, H.Y.: Linear complexity of prime \(n\)-square sequences. In: Proc. IEEE Int. Symp. Information Theory 2008, pp. 2405–2408 (2008)

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

    Article  MATH  MathSciNet  Google Scholar 

  17. Lidl, R., Neiderreiter, H.: Finite Fields, Encyclopedia Math. Appl. 20, 2nd edn. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  18. Sidelnikov, V.M.: Some \(k\)-valued pseudo-random sequences and nearly equidistant codes. Probl. Pereda. Inf. 5(1), 16–22 (1969)

    MathSciNet  Google Scholar 

  19. Simon, M.K., Omura, J.K., Scholtz, R.A., Levitt, B.K.: Spread Spectrum Communications Handbook, vol. 2. McGraw-Hill, New York (1994)

    Google Scholar 

  20. Yan, T., Li, S., Xiao, G.: On the linear complexity of generalized cyclotomic sequences with the period \(p^{m}\). Appl. Math. Lett. 21(2), 187–193 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  21. Zhang, J., Zhao, C.A., Ma, X.: Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\). Appl. Algebra Eng. Commun. Comput. 21(2), 93–108 (2010)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We are very grateful to the helpful comments from the Editor and reviewers which improved the quality and the presentation of our manuscript. The work of Jingwei Zhang is partially supported by the the Natural Science Foundation of Guangdong University of Finance and Economics under Grant No. 14GJPY12001, and the National Natural Science Foundation of China under Grants No. 61300204 and 61300108. The work of Chang-An Zhao is partially supported by the Natural Science Foundation of China under Grant No. 61472457.

Author information

Authors and Affiliations

  1. School of Information Science, Guangdong University of Finance and Economics, Guangzhou, 510320, People’s Republic of China

    Jingwei Zhang

  2. Department of Mathematics, Sun Yat-sen University, Guangzhou, 510275, People’s Republic of China

    Chang-An Zhao

Authors
  1. Jingwei Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chang-An Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chang-An Zhao.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, J., Zhao, CA. The linear complexity of a class of binary sequences with period \(2p\) . AAECC 26, 475–491 (2015). https://doi.org/10.1007/s00200-015-0261-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-015-0261-8

Keywords

Search

Navigation