Skip to main content
Log in

Complete Weight Enumerator for a Class of Linear Codes from Defining Sets and Their Applications

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Recently, linear codes over finite fields with a few weights have been extensively studied due to their applications in secret sharing schemes, authentication codes, constant composition codes. In this paper, for an odd prime p, the complete weight enumerator of a class of p-ary linear codes based on defining sets are determined. Furthermore, from the explicit complete weight enumerator of linear codes, a new class of optimal constant composition codes and several classes of asymptotically optimal systematic authentication codes are obtained.

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

Access this article

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. Ding C S and Wang X, A coding theory construction of new systematic authentication codes, Theor. Comput. Sci., 2005, 330(1): 81–99.

    Article  MathSciNet  MATH  Google Scholar 

  2. Anderson R, Ding C S, Helleseth T, et al., How to build robust shared control systems, Des. Codes Cryptogr., 1998, 15(2): 111–124.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Chu W, Colbourn C J, and Dukes P, On constant composition codes, J. Combin. Mathe. Combin. Comput., 2006, 154(6): 912–929.

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Ding C S and Yang J, Hamming weights in irreducible cyclic codes, Discret. Math., 2013, 313(4): 434–446.

    Article  MathSciNet  MATH  Google Scholar 

  10. Ding C S, Gao Y, and Zhou Z C, Five families of three-weight ternary cyclic codes and their duals, IEEE Trans. Inf. Theory, 2013, 59(12): 7940–7946.

    Article  MathSciNet  MATH  Google Scholar 

  11. Yang S D and Zheng A Y, Complete weight enumerators of a family of three-weight linear codes, Des. Codes Cryptogr., 2017, 82(3): 663–674.

    Article  MathSciNet  MATH  Google Scholar 

  12. Ding C S, Helleseth T, Klóve T, et al., A general construction of authentication codes, IEEE Trans. Inf. Theory, 2007, 53(6): 2229–2235.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Ahn J, Ka D, and Li C J, Complete weight enumerators of a class of linear codes, Des. Codes Cryptogr., 2017, 81(1): 83–99.

    Article  MathSciNet  MATH  Google Scholar 

  15. Bae S, Li C J, and Yue Q, On the complete weight enumerators of some reducible cyclic codes, Discret. Math., 2015, 338(12): 2275–2287.

    Article  MathSciNet  MATH  Google Scholar 

  16. Blake I F and Kith K, On the complete weight enumerator of Reed-Solomon codes, Siam Jour. on Discret. Math., 1991, 4(2): 164–171.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. Li C J, Yue Q, and Fu F W, Complete weight enumerators of some cyclic codes, Des. Codes Cryptogr., 2016, 80(2): 295–315.

    Article  MathSciNet  MATH  Google Scholar 

  19. Li F, Wang Q Y, and Lin D D, Complete weight enumerators of a class of three-weight linear codes, J. Appl. Math. Comput., 2017, 55(1–2): 733–747.

    Article  MathSciNet  MATH  Google Scholar 

  20. Yang S D, Zheng A Y, and Zhao C A, A class of three-weight linear codes and their complete weight enumerators, Cryptogr. Commun., 2017, 9(1): 133–149.

    Article  MathSciNet  MATH  Google Scholar 

  21. Yang S D and Zheng A Y, Complete weight enumerators of a class of linear codes, Discret. Math., 2017, 340: 729–739.

    Article  MathSciNet  MATH  Google Scholar 

  22. Yang S D, Kong, X L, and Tang C M, A construction of linear codes and their complete weight enumerators, Finite Fields Appl., 2017, 48: 196–226.

    Article  MathSciNet  MATH  Google Scholar 

  23. Yang S D, Zheng A Y, and Chang A Z, The weight enumerator of the duals of a class of cyclic codes with three zeros, Applicable Algebra in Engineering Communication and Computing, 2015, 26(4): 347–367.

    Article  MathSciNet  MATH  Google Scholar 

  24. Yang S D, Zheng A Y, and Chang A Z, The weight distribution of two classes of p-ary cyclic codes with few weights, Finite Fields Appl., 2017, 44: 76–91.

    Article  MathSciNet  MATH  Google Scholar 

  25. Ding K L and Ding C S, Binary linear codes with three weights, IEEE Commun. Lett., 2014, 18(11): 1879–1882.

    Article  Google Scholar 

  26. Li F, Wang Q Y, and Lin D D, A class of three-weight and five-weight linear codes, Discret. Appl. Math., 2017, arXiv: 1509.06242v1.

    Google Scholar 

  27. Wang Q, Ding K L, and Xue R, Binary linear codes with two weights, IEEE Commun. Lett., 2015, 19(7): 1097–1100.

    Article  Google Scholar 

  28. Lidl R, Niederreiter H, and Cohn F M, Finite Fields, Cambridge University Press, Cambridge 1997.

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  30. Ding C S and Yuan J, A family of optimal constant-composition codes, IEEE Trans. Inf. Theory, 2015, 51(10): 3668–3671.

    Article  MathSciNet  MATH  Google Scholar 

  31. Ding C S and Yin J, Combinatorial constructions of optimal constant-composition codes, IEEE Trans. Inf. Theory, 2005, 51(10): 3671–3674.

    Article  MathSciNet  MATH  Google Scholar 

  32. Luo Y, Fu F W, Vinck A H, et al., On constant-composition codes over Zp, IEEE Trans. Inf. Theory, 2003, 49(11): 3010–3016.

    Article  MATH  Google Scholar 

  33. Rees R S and Stinson D R, Combinatorial characterizations of authentication codes II, Des. Codes Cryptogr., 1996, 7(3): 239–259.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qunying Liao.

Additional information

This research was supported by the National Natural Science Foundation of China under Grant No. 11401408, Project of Science and Technology Department of Sichuan Province under Grant No. 2016JY0134, the National Key R and Program of China under Grant No. 2016QY04W080

This paper was recommended for publication by Editor ZHANG Zhifang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, H., Liao, Q. & Wang, X. Complete Weight Enumerator for a Class of Linear Codes from Defining Sets and Their Applications. J Syst Sci Complex 32, 947–969 (2019). https://doi.org/10.1007/s11424-018-7414-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-018-7414-3

Keywords

Navigation