[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Combinatorial t-designs from quadratic functions

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Combinatorial t-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a t-design. Till now only a small amount of work on constructing t-designs from special polynomials has been done, and it is in general hard to determine their parameters. In this paper, we investigate this idea further by using quadratic functions over finite fields, thereby obtain infinite families of 2-designs, and explicitly determine their parameters. The obtained designs cover some earlier 2-designs as special cases. Furthermore, we confirm Conjecture 3 in Ding and Tang (ArXiv:1903.07375, 2019).

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

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. Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999).

    Book  Google Scholar 

  3. Bluher A.W.: On \(x^{q+1} + ax + b\). Finite Fields Appl. 10, 285–305 (2004).

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Book  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Ding C., Tang C.: Combinatorial \(t\)-designs from special polynomials. ArXiv: 1903.07375 (2019).

  9. Du X., Wang R., Tang C., Wang Q.: Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. ArXiv:1903.08153v1 (2019).

  10. Du X., Wang R., Fan C.: Infinite families of 2-designs from a class of cyclic codes with two non-zeros. ArXiv:1904.04242v1 (2019).

  11. Du X., Wang R., Tang C., Wang Q.: Infinite families of 2-designs from two classes of linear codes. ArXiv:1903.07459v1 (2019).

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

    Article  MathSciNet  Google Scholar 

  13. Kim J.-L., Pless V.: Designs in additive codes over GF(4). Des. Codes Cryptogr. 30(2), 187–199 (2003).

    Article  MathSciNet  Google Scholar 

  14. Liu H., Ding C.: Infinite families of \(2\)-designs from \({\rm GA}_1(q)\) actions. ArXiv:1707.02003 (2017).

  15. MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977).

    MATH  Google Scholar 

  16. Reid C., Rosa A.: Steiner systems \(S(2,4)\)-a survey. Electron. J. Comb. 1000, 18-1 (2010).

    Article  Google Scholar 

  17. Shrikhande M.S.: Quasi-symmetric designs. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 102–110. CRC Press, New York (2007).

    Google Scholar 

  18. Tang C.: Infinite families of 3-designs from APN functions. J. Comb. Des. (2019). https://doi.org/10.1002/jcd.21685.

    Article  MathSciNet  Google Scholar 

  19. Tang C., Ding C., Xiong M.: Steiner systems \( S (2, 4,\frac{3^ m-1}{2}) \) and \(2\)-designs from ternary linear codes of length \(\frac{3^ m-1}{2} \). Des. Codes Cryptogr. (2019). https://doi.org/10.1007/s10623-019-00651-8.

    Article  MATH  Google Scholar 

  20. 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).

    Google Scholar 

  21. Tonchev V.D.: Codes. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 677–701. CRC Press, New York (2007).

    Google Scholar 

Download references

Acknowledgements

The authors are very grateful to the reviewers and the Editor, for their comments and suggestions that improved the presentation and quality of this paper. The research of C. Xiang was supported by the National Natural Science Foundation of China (No. 11701187) and the PhD Start-up Fund of the Natural Science Foundation of Guangdong Province of China (No. 2017A030310522). The research of X. Ling was supported by the National Natural Science Foundation of China (No. 11871058). The research of Q. Wang was supported by the National Natural Science Foundation of China under Grant No. 61672015.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Can Xiang.

Additional information

Communicated by L. Teirlinck.

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

Xiang, C., Ling, X. & Wang, Q. Combinatorial t-designs from quadratic functions. Des. Codes Cryptogr. 88, 553–565 (2020). https://doi.org/10.1007/s10623-019-00696-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-019-00696-9

Keywords

Mathematics Subject Classification

Navigation