Combinatorial t-designs from quadratic functions

被引:13
作者
Xiang, Can [1 ]
Ling, Xin [2 ]
Wang, Qi [3 ]
机构
[1] S China Agr Univ, Coll Math, Informat, Guangzhou, Guangdong, Peoples R China
[2] China w Normal Univ, Sch Math, Informat, Nanchong, Sichuan, Peoples R China
[3] So Univ Sci, Dept Comp Sci, Engn, Technol, Shenzhen, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Polynomial; Quadratic functions; t-Design; INFINITE FAMILIES; 3-DESIGNS;
D O I
10.1007/s10623-019-00696-9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 (, 2019).
引用
收藏
页码:553 / 565
页数:13
相关论文
共 21 条
[1]  
Assmus Jr E.F., 1992, Designs and their Codes
[2]  
Beth T., 1999, Design Theory
[3]   On xq+1+ax+b [J].
Bluher, AW .
FINITE FIELDS AND THEIR APPLICATIONS, 2004, 10 (03) :285-305
[4]  
Ding C., 2015, Codes From Difference Sets
[5]  
Ding C., 2019, ARXIV190307375
[6]  
Ding C., 2018, Designs From Linear Codes
[7]   Infinite families of 3-designs from a type of five-weight code [J].
Ding, Cunsheng .
DESIGNS CODES AND CRYPTOGRAPHY, 2018, 86 (03) :703-719
[8]   Infinite families of 2-designs and 3-designs from linear codes [J].
Ding, Cunsheng ;
Li, Chengju .
DISCRETE MATHEMATICS, 2017, 340 (10) :2415-2431
[9]   A CODING THEORETIC APPROACH TO EXTENDING DESIGNS [J].
KENNEDY, GT ;
PLESS, V .
DISCRETE MATHEMATICS, 1995, 142 (1-3) :155-168
[10]   Designs in additive codes over GF(4) [J].
Kim, JL ;
Pless, V .
DESIGNS CODES AND CRYPTOGRAPHY, 2003, 30 (02) :187-199