Binary (k,k)-designs

2020/04/08 by Alexandrova, Todorka, Boyvalenkov, Peter, Dimitrov, Angel
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2004.03963

Abstract

We introduce and investigate binary (k,k)-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 (k,k)-designs for fixed k and length n. Designs which attain our bound are investigated.

Related

• Combinatorial characterzations of T-designs in the nonbinary Johnson scheme
• Explicit combinatorial design
• Linear programming bounds for spherical (k,k)-designs
• Infinite families of t-designs from a type of five-weight codes
• Infinite families 2-designs from binary projective three-weight codes