Infinite families of 3-designs from APN functions
read the original abstract
Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence structure formed by the orbits of a base block under the action of the general affine groups, which are $2$-transitive, is considered. A characterization of such incidence structure to be a $3$-design is presented, and a sufficient condition for the stabilizer of a base block to be trivial is given. With these general results, infinite families of $3$-designs are constructed by employing APN functions. Some $3$-designs presented in this paper give rise to self-dual binary codes or linear codes with optimal or best parameters known. Several conjectures on $3$-designs and binary codes are also presented.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Combinatorial t-designs from quadratic functions
Quadratic functions over finite fields produce infinite families of 2-designs with explicitly determined parameters, generalizing prior examples and confirming a 2019 conjecture.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.