Binary (k,k)-designs
Combinatorics
2020-04-09 v1
Abstract
We introduce and investigate binary -designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible cardinality of -designs for fixed and length . Designs which attain our bound are investigated.
Cite
@article{arxiv.2004.03963,
title = {Binary (k,k)-designs},
author = {Todorka Alexandrova and Peter Boyvalenkov and Angel Dimitrov},
journal= {arXiv preprint arXiv:2004.03963},
year = {2020}
}
Comments
10 pages, submitted