Infinite families of 3-designs from APN functions
Abstract
Combinatorial -designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain -designs with -transitive permutation groups. The incidence structure formed by the orbits of a base block under the action of the general affine groups, which are -transitive, is considered. A characterization of such incidence structure to be a -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 -designs are constructed by employing APN functions. Some -designs presented in this paper give rise to self-dual binary codes or linear codes with optimal or best parameters known. Several conjectures on -designs and binary codes are also presented.
Keywords
Cite
@article{arxiv.1904.04071,
title = {Infinite families of 3-designs from APN functions},
author = {Chunming Tang},
journal= {arXiv preprint arXiv:1904.04071},
year = {2019}
}
Comments
25 pages