论文标题
二进制（K，K） - 设计
Binary (k,k)-designs
论文作者
论文摘要
我们介绍和调查与二进制正交阵列相关的二进制$（k，k）$ - 设计 - 组合结构。我们得出了一般线性编程的限制，并提出了一种通用限制的$（k，k）$ - 固定$ k $和长度$ n $的设计。研究了达到我们约束的设计。
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.
