Infinite families of 3-designs from APN functions

04/05/2019
by   Chunming Tang, et al.
0

Combinatorial t-designs have nice applications in coding theory, finite geometries and several engineering areas. A classical method for constructing t-designs is by the action of a permutation group that is t-transitive or t-homogeneous on a point set. This approach produces t-designs, but may not yield (t+1)-designs. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2022

Some 3-designs and shortened codes from binary cyclic codes with three zeros

Linear codes and t-designs are interactive with each other. It is well k...
research
10/08/2021

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3,8, 7^m+1)

Coding theory and combinatorial t-designs have close connections and int...
research
07/30/2019

Codes, differentially δ-uniform functions and t-designs

Special functions, coding theory and t-designs have close connections an...
research
07/14/2019

Combinatorial t-designs from quadratic functions

Combinatorial t-designs have been an interesting topic in combinatorics ...
research
10/29/2020

Capacity-achieving codes: a review on double transitivity

Recently it was proved that if a linear code is invariant under the acti...
research
01/15/2021

Random and quasi-random designs in group testing

For large classes of group testing problems, we derive lower bounds for ...
research
09/19/2021

On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and their Consequences

The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass o...

Please sign up or login with your details

Forgot password? Click here to reset