Infinite families of $2$-designs from two classes of linear codes
Combinatorics
2019-03-19 v1
Abstract
The interplay between coding theory and -designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a -design. In this paper, by determining the weight distributions of two classes of linear codes, we derive infinite families of -designs from the supports of codewords with a fixed weight in these codes, and explicitly obtain their parameters.
Cite
@article{arxiv.1903.07459,
title = {Infinite families of $2$-designs from two classes of linear codes},
author = {Xiaoni Du and Rong Wang and Chunming Tang and Qi Wang},
journal= {arXiv preprint arXiv:1903.07459},
year = {2019}
}