Binary (k, k)-Designs

We introduce and investigate binary (k,k)-designs, a special case of T-designs. Our combinatorial interpretation relates (k,k)-designs to the binary orthogonal arrays. We derive a 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 n. Designs which attain our bound are investigated.