$q$-Analogs for Steiner Systems and Covering Designs
Combinatorics
2015-03-13 v2
Abstract
The -analogs of basic designs are discussed. It is proved that the existence of any unknown Steiner structures, the -analogs of Steiner systems, implies the existence of unknown Steiner systems. Optimal -analogs covering designs are presented. Some lower and upper bounds on the sizes of -analogs covering designs are proved.
Keywords
Cite
@article{arxiv.0912.1503,
title = {$q$-Analogs for Steiner Systems and Covering Designs},
author = {Tuvi Etzion and Alexander Vardy},
journal= {arXiv preprint arXiv:0912.1503},
year = {2015}
}
Comments
submitted for ALCOMA10