Skip to main content
SpringerLink
Log in

Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

A Correction to this article was published on 15 September 2022

This article has been updated

Abstract

In data storage systems, authentication codes, and some other fields, linear codes with few weights play an important role. In this paper, we use Kloosterman sums to construct two classes of 2-weight and 3-weight linear codes with new parameters.

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

Change history

References

  1. Anderson, R.J., Ding, C., Hellsesth, T., Klove, T.: How to buildrobust shared control systems. Des. Codes Cryptogr 15(2), 111–123 (1998)

    Article  MathSciNet  Google Scholar 

  2. Calderbank, A., Goethals, J.: Three-weight codes and association schemes. Philips J. Res 39, 143–152 (1984)

    MathSciNet  MATH  Google Scholar 

  3. Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory. 51(6), 2089–2102 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Carlitz, L.: Kloosterman sums and finite field extensions. Acta Arith. 16(2), 179–194 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding, C.: Linear codes from some 2-designs. IEEE Trans. Inf. Theory. 60(6), 3265–3275 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ding, C.: A construction of binary linear codes from Boolean functions. Discrete Math. 339(9), 2288–2303 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ding, K., Ding, C.: A class of two-weight and three-weight codes and their applications in secret sharing. IEEE Trans. Inf. Theory. 61(11), 5835–5842 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ding, C., Helleseth, T., Klove, T., Wang, X.: A generic construction of Cartesian authentication codes. IEEE Trans. Inf. Theory. 53(6), 2229–2235 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ding, C., Niederreiter, H.: Cyclotomic linear codes of order 3. IEEE Trans. Inf. Theory. 53(6), 2274–2277 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ding, C., Wang, X.: A coding theory construction of new systematic authentication codes. Theor. Comput. Sci. 330(1), 81–99 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  11. Helleseth, T., Kholosha, A.: Monomial and quadratic bent functions over the finite fields of odd characteristic. IEEE Trans. Inf. Theory. 52(5), 2018–2032 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hu, Z., Li, N., Zeng, X.: New linear codes with few weights derived from Kloosterman sums. Finite Fields Appl. 62(3), 101608 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  13. W. Huffman, V. Pless, Fundamentals of Error-Correcting Codes, Cambridge University Press, (1997)

  14. Heng, Z., Yue, Q.: Two classes of two-weight linear codes. Finite Fields Appl. 38, 72–92 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lidl, R., Niederreiter, H.: Finite Fields, Encyclopedia of Mathematics, vol. 20. Cambridge University Press, Cambridge (1983)

    MATH  Google Scholar 

  16. Leander, N.G.: Monomial bent functions. IEEE Trans. Inf. Theory. 52(2), 738–743 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Li, C., Yue, Q., Li, F.: Weight distributions of cyclic codes with respect to pairwise coprime order elements. Finite Fields Appl. 28, 94–114 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  18. Li, C., Bae, S., Ahn, J., Yang, S.: Complete weight enumerators of some linear codes. Des. Codes Cryptogr. 81(1), 153–168 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  19. Tan, P., Zhou, Z., Tang, D., Helleseth, T.: The weight distribution of a class of two-weight linear codes derived from Kloosterman sums. Cryptogr. Commun. 10(2), 291–299 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wolfmann, J.: Bent functions and coding theory, Difference Sets, Sequences and their Correlation Properties. Pott, A., Kumar, P.V., Helleseth, T., Jungnickel, D. (eds.) Kluwer, pp. 393–417 (1999)

  21. Wu, Y., Yue, Q., Zhu, X., Yang, S.: Weight enumerators of reducible cyclic codes and their dual codes. Discret. Math. 342(3), 671–682 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  22. Wu, Y., Yue, Q., Shi, X.: At most three-weight binary linear codes from generalized Moisio’s exponential sums. Des. Codes Cryptogr. 87, 1927–1943 (2019)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Nanjing University of Aeronautics and Astronautics, 211100, Nanjing, People’s Republic of China

    Xiaoshan Quan, Qin Yue & Xia Li

  2. Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, 200062, Shanghai, People’s Republic of China

    Chengju Li

  3. The National Mobile Communications Research Laboratory, Southeast University, 210096, Nanjing, People’s Republic of China

    Chengju Li

Authors
  1. Xiaoshan Quan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qin Yue
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xia Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chengju Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qin Yue.

Additional information

The paper was supported by National Natural Science Foundation of China (No. 12071138, No. 62172219, No. 12171420); Shanghai Natural Science Foundation (No. 22ZR1419600); the open research fund of National Mobile Communications Research Laboratory Southeast University (No. 2022D05), Natural Science Foundation of Shandong Province under Grant (ZR2021MA046); Natural Science Foundation of Jiangsu Province under Grant (BK20200268).

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Quan, X., Yue, Q., Li, X. et al. Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums. Cryptogr. Commun. 15, 365–380 (2023). https://doi.org/10.1007/s12095-022-00604-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-022-00604-4

Keywords

Mathematics subject classification (2010)

Search

Navigation