An infinite family of Hadamard matrices of Williamson type
From MaRDI portal
Publication:2560250
DOI10.1016/0097-3165(73)90010-1zbMath0259.05016OpenAlexW2020642350MaRDI QIDQ2560250
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(73)90010-1
Related Items (21)
Regular sets of matrices and applications ⋮ Hadamard Matrices, Finite Sequences, and Polynomials Defined on the Unit Circle ⋮ Hadamard matrices of the Williamson type of order 4\(\cdot m\), \(m=p\cdot q\) an exhaustive search for \(m=33\) ⋮ On the Williamson type j matrices of orders \(4\cdot 29\), \(4\cdot 41\), and \(4\cdot 37\) ⋮ Construction of Williamson type matrices ⋮ Williamson matrices of orders \(4 \cdot 29\) and \(4 \cdot 31\) ⋮ Supplementary difference sets and Jacobi sums ⋮ Some infinite classes of special Williamson matrices and difference sets ⋮ An infinite family of Goethals-Seidel arrays ⋮ Hadamard matrices of order 4(2p+1) ⋮ A new method for constructing Williamson matrices ⋮ Construction of relative difference sets and Hadamard groups ⋮ Skew-Hadamard matrices of order 2(q + 1) ⋮ Williamson matrices of order \(4n\) for \(n = 33, 35, 39\) ⋮ Williamson matrices up to order 59 ⋮ Unnamed Item ⋮ Hadamard matrices of order 28\(m\), 36\(m\) and 44\(m\) ⋮ Skew Hadamard matrices of Goethals-Seidel type ⋮ On supplementary difference sets ⋮ Square \((1,-1)\)-matrices with large determinants and near-Hadamard matrices ⋮ A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
Cites Work
This page was built for publication: An infinite family of Hadamard matrices of Williamson type