Infinite families of 2-designs from GA_1(q) actions
Combinatorics
2017-07-10 v1
Abstract
Group action is a standard approach to obtain -designs. In this approach, selecting a specific permutation group with a certain degree of transitivity or homogeneity and a proper set of base blocks is important for obtaining - designs with computable parameters , and . The general affine group is -transitive on , and has relatively a small size. In this paper, we determine the parameters of a number of infinite families of -designs obtained from the action of the group on certain base blocks, and demonstrate that some of the -designs give rise to linear codes with optimal or best parameters known. Open problems are also presented.
Keywords
Cite
@article{arxiv.1707.02003,
title = {Infinite families of 2-designs from GA_1(q) actions},
author = {Hao Liu and Cunsheng Ding},
journal= {arXiv preprint arXiv:1707.02003},
year = {2017}
}