Skip to main content
Log in

The linear codes of t-designs held in the Reed-Muller and Simplex codes

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

A fascinating topic of combinatorics is the study of t-designs, which has a very long history. The incidence matrix of a t-design generates a linear code over GF(q) for any prime power q, which is called the linear code of the t-design over GF(q). On the other hand, some linear codes hold t-designs with t ≥ 1. The purpose of this paper is to study the linear codes of t-designs held in the Reed-Muller and Simplex codes. Some general theory for the linear codes of t-designs held in linear codes is presented. Several open problems are also presented.

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.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)

    Book  Google Scholar 

  2. Assmus Jr., E.F., Key, J.D.: Polynomial Codes and Finite Geometries. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Vol. II, pp. 1269-1343. Elsevier, Amsterdam (1998)

  3. Assmus Jr., E.F., Mattson Jr., H.F.: New 5-designs. J. Comb. Theory 6, 122–151 (1969)

    Article  MathSciNet  Google Scholar 

  4. Beth, T., Jungnickel, D., Lenz, H.: Design Theory. Cambridge University Press, Cambridge (1999)

    Book  Google Scholar 

  5. Ceccherini, P.V., Hirschfeld, J.W.P.: The dimension of projective geometry codes. Discrete Math. 107, 117–126 (1992)

    Article  MathSciNet  Google Scholar 

  6. Charpin, P.: Codes cycliques étendus affines-invariants et antichaînes d’un ensemble partiellement ordonné. Discrete Math. 80, 229–247 (1990)

    Article  MathSciNet  Google Scholar 

  7. Delsarte, P.: On subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inf. Theory 21(5), 575–576 (1975)

    Article  MathSciNet  Google Scholar 

  8. Ding, C.: Codes from Difference Sets. World Scientific, Singapore (2015)

    Google Scholar 

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

    Book  Google Scholar 

  10. Ding, C., Munemasa, A., Tonchev, V.D.: Bent vectorial functions, codes and designs. IEEE Trans. Inf. Theory 65(11), 7533–7541 (2019)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Hamada, N.: The rank of the incidence matrix of points and d-flats in finite geometries. J. Sci. Hiroshima Univ. Ser. A-I 32, 381–396 (1968)

    MathSciNet  MATH  Google Scholar 

  13. Hamada, N.: On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J. 3, 153–226 (1973)

    Article  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  15. Jungnickel, D., Magliveras, S.S., Tonchev, V.D., Wassermann, A., et al.: On Classifying Steiner Triple Systems by Their 3-Rank. In: Blömer, J. (ed.) MACIS 2017, LNCS 10693, pp. 295–305. Springer, Cham (2017)

  16. Kennedy, G.T., Pless, V.: A coding-theoretic approach to extending designs. Discrete Math. 142, 155–168 (1995)

    Article  MathSciNet  Google Scholar 

  17. Li, S.: On the weight distribution of second order Reed-Muller codes and their relatives. Des. Codes Cryptogr. 80, 2447–2460 (2019)

    Article  MathSciNet  Google Scholar 

  18. McGuire, G., Ward, H.N.: Characterization of certain minimal rank designs. J. Comb. Theory Ser. A 83, 42–56 (1998)

    Article  MathSciNet  Google Scholar 

  19. Serre, J.P.: Letter to M. Tsafasman, dated July 29 (1989)

  20. Tonchev, V.D.: Quasi-symmetric designs, codes, quadrics, and hyperplane sections. Geom. Dedicata. 48, 295–308 (1993)

    Article  MathSciNet  Google Scholar 

  21. Tonchev, V.D.: Codes and Designs. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, Vol. II, pp. 1229-1268. Elsevier, Amsterdam (1998)

  22. Tonchev, V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Cryptogr. 17, 121–128 (1999)

    Article  MathSciNet  Google Scholar 

  23. Tonchev, V.D. Colbourn, C.J., Dinitz, J.H. (eds.) . CRC Press, New York (2007)

Download references

Acknowledgments

The authors are grateful to the reviewers for their comments that improved the presentation of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chunming Tang.

Additional information

Publisher’s note

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

This article belongs to the Topical Collection: Boolean Functions and Their Applications V

Guest Editors: Lilya Budaghyan, Claude Carlet, Tor Helleseth and Kaisa Nyberg

C. Ding’s research was supported by the Hong Kong Research Grants Council, Proj. No. 16300418. C. Tang was supported by National Natural Science Foundation of China (Grant No. 11871058) and China West Normal University (14E013, CXTD2014-4 and the Meritocracy Research Funds).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ding, C., Tang, C. The linear codes of t-designs held in the Reed-Muller and Simplex codes. Cryptogr. Commun. 13, 927–949 (2021). https://doi.org/10.1007/s12095-021-00470-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-021-00470-6

Keywords

Mathematics Subject Classification (2010)

Navigation