English

Infinite families of 3-designs from APN functions

Information Theory 2019-04-10 v2 math.IT

Abstract

Combinatorial tt-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain 33-designs with 22-transitive permutation groups. The incidence structure formed by the orbits of a base block under the action of the general affine groups, which are 22-transitive, is considered. A characterization of such incidence structure to be a 33-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 33-designs are constructed by employing APN functions. Some 33-designs presented in this paper give rise to self-dual binary codes or linear codes with optimal or best parameters known. Several conjectures on 33-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