Skip to main content
SpringerLink
Log in

A correction to: on the linear complexity of the Sidelnikov–Lempel–Cohn–Eastman sequences

  • Commentary
  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

In the paper of Kyureghyan and Pott (Des Codes Cryptogr 29:149–164, 2003), the linear feedback polynomials of the Sidelnikov–Lempel–Cohn–Eastman sequences were determined for some special cases. We found that Corollary 4 and Theorem 2 of that paper are wrong because there exist counterexamples for these two results. In this note, we give some counterexamples of Corollary 4 and Theorem 2, and correct them by readopting the negation of the condition of Lemma 5 as their necessary and sufficient conditions.

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.

Similar content being viewed by others

References

  1. Berndt B.C., Evans R.J., Williams K.S.: Gauss and Jacobi Sums. Wiley, New York (1998).

    MATH  Google Scholar 

  2. Kyureghyan G.M., Pott A.: On the linear complexity of the Sidelnikov–Lempel–Cohn–Eastman sequences. Des. Codes Cryptogr. 29, 149–164 (2003).

    Article  MathSciNet  MATH  Google Scholar 

  3. Lidl R., Niederreiter H.: Finite Fields, Encyclopedia of Mathematics and Its Applications, vol. 20, 2nd edn. Cambridge University Press, Cambridge (1997).

    Google Scholar 

Download references

Acknowledgements

The authors of the present corrigendum thank very much the anonymous reviewer and the editor for their valuable comments and analysis. Minglong Qi was supported by the Foundation for the project Middleware Technologies of the Wuhan University of Technology under Grant 2012037. Shengwu Xiong was supported by the Foundation for the project Formation Model for Engineers in Software Engineering of Hubei Province under Grant 2012103.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Wuhan University of Technology, Mafangshan West Campus, Wuhan, 430070, China

    Minglong Qi & Shengwu Xiong

Authors
  1. Minglong Qi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shengwu Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Minglong Qi.

Additional information

Communicated by D. Jungnickel.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Original paper: https://link.springer.com/article/10.1023/A%3A1024156525801.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qi, M., Xiong, S. A correction to: on the linear complexity of the Sidelnikov–Lempel–Cohn–Eastman sequences. Des. Codes Cryptogr. 87, 2391–2393 (2019). https://doi.org/10.1007/s10623-019-00625-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-019-00625-w

Keywords

Mathematics Subject Classification

Search

Navigation