Skip to main content
Log in

Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

This paper is devoted to the affine-invariant ternary codes defined by Hermitian functions. We first compute the incidence matrices of the 2-designs supported by the minimum weight codewords of these ternary codes. Then we show that the linear codes spanned by the rows of these incidence matrices are subcodes of the 4-th order generalized Reed-Muller codes and also hold 2-designs. Finally, we determine the dimension and develop a lower bound on the minimum distance of the ternary linear codes.

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. Assmus Jr., E. F., Key, J. D.: Polynomial codes and finite geometries. In: Pless, V. S., Huffman, W. C. (eds.) The Handbook of Coding Theory, vol. II, pp 1269–1343. Elsevier, Amsterdam (1998)

  2. Assmus Jr., E. F., Key, J. D.: Designs and their Codes. Cambridge University Press, Cambridge (1992)

    Book  Google Scholar 

  3. Ding, C.: Designs from Linear Codes. World Scientific, Singapore (2018)

    Book  Google Scholar 

  4. Ding, C., Tang, C., Tonchev, D.: Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. Des. Codes Cryptogr. 88, 625–641 (2020)

    Article  MathSciNet  Google Scholar 

  5. Ding, C., Tang, C.: Infinite families of near MDS codes holding t-designs. IEEE Trans. Inf. Theory 66(9), 5419–5428 (2020)

    Article  MathSciNet  Google Scholar 

  6. Ding, C.: Infinite families of 3-designs from a type of five-weight code. Des. Codes Cryptogr. 86(3), 703–719 (2018)

    Article  MathSciNet  Google Scholar 

  7. Ding, C., Li, C.: Infinite families of 2-designs and 3-designs from linear codes. Discrete Math. 340(10), 2415–2431 (2017)

    Article  MathSciNet  Google Scholar 

  8. Du, X., Wang, R., Tang, C., Wang, Q.: Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. Adv. Math. Commun., https://doi.org/10.3934/amc.2020106 (2020)

  9. Du, X., Wang, R., Fan, C.: Infinite families of 2-designs from a class of cyclic codes with two non-zeros. arXiv:1904.04242[math.CO] (2019)

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

    Book  Google Scholar 

  11. Tang, C., Ding, C.: An infinite family of linear codes supporting 4-designs. IEEE Trans. Inf. Theory, https://doi.org/10.1109/TIT.2020.3032600 (2020)

  12. Wang, R., Du, X., Fan, C.: Infinite families of 2-designs from a class of non-binary Kasami cyclic codes. Adv. Math. Commun., https://doi.org/10.3934/amc.2020088 (2019)

  13. Wan, Z.: Finite Fields and Galois Rings. World Scientific, USA (2011)

    Book  Google Scholar 

Download references

Acknowledgments

The work of the first author was supported by The National Natural Science Foundation of China under Grant No. 11771392.

Funding

National Natural Science Foundation of China under Grant No. 11771392.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jiejing Wen.

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

He, Z., Wen, J. Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes. Cryptogr. Commun. 13, 407–423 (2021). https://doi.org/10.1007/s12095-021-00472-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-021-00472-4

Keywords

Mathematics Subject Classification (2010)

Navigation