Binary (k,k)-designs

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.

No reviews yet.

No comments yet.