Hadamard matrices of the Williamson type of order 4\(\cdot m\), \(m=p\cdot q\) an exhaustive search for \(m=33\)
From MaRDI portal
Publication:1117230
DOI10.1016/0012-365X(88)90040-4zbMath0667.05010MaRDI QIDQ1117230
Stratis Kounias, Christos Koukouvinos
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (8)
Combining SAT solvers with computer algebra systems to verify combinatorial conjectures ⋮ Williamson matrices of orders \(4 \cdot 29\) and \(4 \cdot 31\) ⋮ Williamson matrices of order \(4n\) for \(n = 33, 35, 39\) ⋮ Williamson matrices up to order 59 ⋮ SBIBD(4k\({}^ 2,2k^ 2+k,k^ 2+k)\) and Hadamard matrices of order \(4k^ 2\) with maximal excess are equivalent ⋮ Unnamed Item ⋮ Applying computer algebra systems with SAT solvers to the Williamson conjecture ⋮ Construction of some Hadamard matrices with maximum excess
Cites Work
- Unnamed Item
- On the Williamson type j matrices of orders \(4\cdot 29\), \(4\cdot 41\), and \(4\cdot 37\)
- Recurrence formulas for the construction of Williamson-type matrices
- On Hadamard matrices
- Combinatorics. Room squares, sum-free sets, Hadamard matrices
- An infinite class of Williamson matrices
- An infinite family of Hadamard matrices of Williamson type
- Hadamard's determinant theorem and the sum of four squares
- Discovery of an Hadamard matrix of order 92
- Construction of Williamson type matrices
- Hadamard Matrices of the Williamson Type
- Hadamard matrices of orders 116 and 232
- Hadamard matrices and their applications
This page was built for publication: Hadamard matrices of the Williamson type of order 4\(\cdot m\), \(m=p\cdot q\) an exhaustive search for \(m=33\)