Skip to main content
SpringerLink
Log in

On the k-error linear complexity of 2p2-periodic binary sequences

  • Letter
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

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

References

  1. Ding C S, Xiao G Z, Shan W J. The Stability Theory of Stream Ciphers. Berlin: Springer, 1991

    Book  Google Scholar 

  2. Cusick T W, Ding C S, Renvall A. Stream Ciphers and Number Theory. Amsterdam: North-Holland Publishing Co., 1998

    MATH  Google Scholar 

  3. Kurosawa K, Sato F, Sakata T, et al. A relationship between linear complexity and k-error linear complexity. IEEE Trans Inform Theor, 2000, 46: 694–698

    Article  MathSciNet  Google Scholar 

  4. Wei S M. An efficient algorithm for determining the k-error linear complexity of binary sequences with periods 2pn. Int J Comput Sci Netw Secur, 2008, 8: 221–224

    Google Scholar 

  5. Zhou J Q. On the fc-error linear complexity of sequences with period 2pn over GF(q). Des Codes Cryptogr, 2011, 58: 279–296

    Article  MathSciNet  Google Scholar 

  6. Ding C S, Helleseth T. New generalized cyclotomy and its applications. Finite Fields Their Appl, 1998, 4: 140–166

    Article  MathSciNet  Google Scholar 

  7. Chen Z X, Niu Z H, Wu C H. On the k-error linear complexity of binary sequences derived from polynomial quotients. Sci China Inf Sci, 2015, 58: 092107

    MathSciNet  Google Scholar 

  8. Chen Z X. Trace representation and linear complexity of binary sequences derived from Fermat quotients. Sci China Inf Sci, 2014, 57: 112109

    MathSciNet  MATH  Google Scholar 

  9. Niu Z H, Chen Z X, Du X N. Linear complexity problems of level sequences of Euler quotients and their related binary sequences. Sci China Inf Sci, 2016, 59: 032106

    Article  Google Scholar 

Download references

Acknowledgements

Zhihua NIU, Can YUAN and Tao ZHANG were partially supported by National Nature Science Foundation of Shanghai (Grant Nos. 16ZR1411200, 17ZR1409800, 19ZR1417700), Research and Development Program in Key Areas of Guangdong Province (Grant No. 2018B010113001), and National Nature Science Foundation of China (Grant No. 61572309). Zhixiong CHEN was partially supported by National Natural Science Foundation of China (Grant No. 61772292) and Projects of International Cooperation and Exchanges NSFC-RFBR (Grant No. 61911530130). Xiaoni DU was partially supported by National Natural Science Foundation of China (Grant No. 61772022).

Author information

Authors and Affiliations

  1. School of Computer Engineering and Science, hanghai University, Shanghai, 200444, China

    Zhihua Niu, Can Yuan & Tao Zhang

  2. Provincial Key Laboratory of Applied Mathematics, Putian University, Putian, 351100, China

    Zhixiong Chen

  3. College of Mathematics and Statistics, Northwest Normal University, Lanzhou, 730070, China

    Xiaoni Du

Authors
  1. Zhihua Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Can Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhixiong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaoni Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhixiong Chen.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Niu, Z., Yuan, C., Chen, Z. et al. On the k-error linear complexity of 2p2-periodic binary sequences. Sci. China Inf. Sci. 63, 199101 (2020). https://doi.org/10.1007/s11432-019-2665-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-019-2665-5

Search

Navigation