Combinatorial t-designs from quadratic functions

DOI10.1007/S10623-019-00696-9zbMATH Open1434.05025arXiv1907.06235OpenAlexW2983228849MaRDI QIDQ2302155FDOQ2302155

Authors: Can Xiang, Xin Ling, Qi Wang 

Publication date: 25 February 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

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 confirmed Conjecture $3$ in Ding and Tang (arXiv: 1903.07375, 2019).

Full work available at URL: https://arxiv.org/abs/1907.06235

Recommendations

• Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
• Combinatorial \(t\)-designs from special functions
• Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
• A large set of designs on vector spaces
• Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros

zbMATH Keywords

\(t\)-designpolynomialquadratic functions

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Special polynomials in general fields (12E10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On \(x^{q+1}+ax+b\)
• Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
• Title not available (Why is that?)
• Steiner systems \(S(2,4,v)\) -- a survey
• Infinite families of 2-designs and 3-designs from linear codes
• Infinite families of 3-designs from a type of five-weight code
• Infinite families of 3‐designs from APN functions
• Designs in additive codes over GF(4)
• A coding theoretic approach to extending designs
• Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)

Cited In (10)

• Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
• Some bounds arising from a polynomial ideal associated to any \(t\)-design
• Combinatorial \(t\)-designs from special functions
• Roots of certain polynomials over finite fields
• Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
• The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\)
• Constructions of cyclic codes and extended primitive cyclic codes with their applications
• Infinite families of 3-designs from special symmetric polynomials
• Infinite families of 2-designs from linear codes
• 2-designs and a differential equation

This page was built for publication: Combinatorial \(t\)-designs from quadratic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302155)