The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search leads to some infinite classes of disjoint weighing matrices, which in turn are shown to form commutative association schemes with 3 or 4 classes.

中文翻译：

---

不相交的称重矩阵

引入不相交权重矩阵的概念是对正交设计的概括。递归构造以及计算机搜索会导致一些无限类的不相交的称重矩阵，这些矩阵依次显示为形成具有3个或4个类的可交换关联方案。