Skip to main content
SpringerLink
Log in

Complete weight enumerators of two classes of linear codes with a few weights

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

Abstract

Linear codes with a few weights have important applications in secret sharing, authentication codes, data storage system, association schemes, and strongly regular graphs. Hence, the construction of linear codes with a few weights is an important research topic in coding theory. In this paper, we construct two new classes of linear codes with two and three weights, and determine their complete weight enumerators. Our work generalizes the results of Wang et al. (Discret Math 340(3):467–480, 2017).

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. 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  Google Scholar 

  2. 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  Google Scholar 

  3. Yuan, J., Ding, C.: Secret sharing schemes from three classes of linear codes. IEEE Trans. Inf. Theory 52(1), 206–212 (2006)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  6. Calderbank, A.R., Kantor, W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18(2), 97–122 (1986)

    Article  MathSciNet  Google Scholar 

  7. Blake, I.F., Kith, K.: On the complete weight enumerator of Reed–Solomon codes. SIAM J. Discret. Math. 4(2), 164–171 (1991)

    Article  MathSciNet  Google Scholar 

  8. Kith K.: Complete weight enumeration of Reed–Solomon codes. Master’s thesis, Department of Electrical and Computing Engineering, University of Waterloo, Waterloo (1989)

  9. Kuzmin, A., Nechaev, A.: Complete weight enumerators of generalized Kerdock code and linear recursive codes over Galois ring. In: Workshop on Coding and Cryptography, pp. 333–336 (1999)

  10. Kuzmin, A., Nechaev, A.: Complete weight enumerators of generalized Kerdock code and related linear codes over Galois ring. Discret. Appl. Math. 111(1), 117–137 (2001)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Tang, C.M., Qi, Y.F., Huang, D.M.: Two-weight and three-weight linear codes from square functions. IEEE Commun. Lett. 20(1), 29–32 (2016)

    Article  Google Scholar 

  13. Wang, Q., Li, F., Ding, K., Lin, D.: Complete weight enumerators of two classes of linear codes. Discret. Math. 340(3), 467–480 (2017)

    Article  MathSciNet  Google Scholar 

  14. Yang, S., Yao, Z.A.: Complete weight enumerators of a family of three-weight linear codes. Des. Codes Cryptogr. 82(3), 663–674 (2017)

    Article  MathSciNet  Google Scholar 

  15. Zhang, D., Fan, C.L., Peng, D.Y., Tang, X.H.: Complete weight enumerators of some linear codes from quadratic forms. Cryptogr. Commun. 9(1), 151–163 (2017)

    Article  MathSciNet  Google Scholar 

  16. Zhou, Z., Li, N., Fan, C.L., Helleseth, T.: Linear codes with two or three weights from quadratic Bent functions. Des. Codes Cryptogr. 81(2), 283–295 (2016)

    Article  MathSciNet  Google Scholar 

  17. 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  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  19. Ding, K., Ding, C.: Bianry linear codes with three weights. IEEE Commun. Lett. 18(11), 1879–1882 (2014)

    Article  Google Scholar 

  20. Coulter, R.S., Matthews, R.W.: Planar functions and planes of Lenz-Barlotti class II. Des. Codes Cryptogr. 10, 167–184 (1997)

    Article  MathSciNet  Google Scholar 

  21. Carlet, C., Ding, C.: Highly nonlinear mappings. J. Complex. 20, 205–244 (2004)

    Article  MathSciNet  Google Scholar 

  22. Coulter, R.S.: Explicit evaluation of some Weil sums. Acta Arith 83, 241–251 (1988)

    Article  MathSciNet  Google Scholar 

  23. Coulter, R.S.: Further evaluation of Weil sums. Acta Arith 3, 217–226 (1998)

    Article  MathSciNet  Google Scholar 

  24. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, New York (1997)

    MATH  Google Scholar 

  25. Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  26. Yang S., Kong X.L.: Complete weight enumerators of a class of linear codes with two or three weights. arXiv: 1901.07162v1 [cs.IT]

  27. Charpin, P., Helleseth, T., Zinoviev, V.: The divisibility modulo 24 of Kloosterman sums on \( GF(2^{m}), m \) odd. J. Comb. Theory Ser. A 114, 322–338 (2007)

    Article  Google Scholar 

  28. Deepika M.P., Sreekumar A.: Secret sharing scheme using gray code and XOR operation. In: ICECCT, Coimbatore, pp. 1-5 (2017)

  29. Dougherty, S.T., Mesnager, S., Solé, P.: Secret-sharing schemes based on self-dual codes. In: IEEE Information Theory Workshop (2008)

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Wuhan University of Technology, Mafangshan West Campus, Wuhan City, 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

Publisher's Note

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

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. Complete weight enumerators of two classes of linear codes with a few weights. AAECC 32, 63–79 (2021). https://doi.org/10.1007/s00200-019-00401-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-019-00401-2

Keywords

Mathematics Subject Classification

Search

Navigation