Disjoint weighing matrices
From MaRDI portal
Publication:2114772
Abstract: The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to form commutative association schemes with 3 or 4 classes.
Recommendations
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3935054 (Why is no real title available?)
- scientific article; zbMATH DE number 3733933 (Why is no real title available?)
- scientific article; zbMATH DE number 3637895 (Why is no real title available?)
- All triples for orthogonal designs of order 40
- Equivalence classes of inverse orthogonal and unit Hadamard matrices
- Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes
- Linked systems of symmetric group divisible designs
- Linked systems of symmetric group divisible designs of type. II
- Spherical codes and designs
- The structure of imprimitive non-symmetric 3-class association schemes
- Three-class association schemes
This page was built for publication: Disjoint weighing matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114772)