Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques
From MaRDI portal
Publication:972300
Recommendations
- A meta-software system for orthogonal designs and Hadamard matrices
- scientific article; zbMATH DE number 2128113
- scientific article; zbMATH DE number 4063098
- Inequivalent Hadamard matrices of order \(2n\) constructed from Hadamard matrices of order \(n\)
- Inequivalent Hadamard matrices from near normal sequences
Cites work
- scientific article; zbMATH DE number 5556283 (Why is no real title available?)
- scientific article; zbMATH DE number 3637895 (Why is no real title available?)
- scientific article; zbMATH DE number 1462937 (Why is no real title available?)
- scientific article; zbMATH DE number 1556755 (Why is no real title available?)
- scientific article; zbMATH DE number 874523 (Why is no real title available?)
- scientific article; zbMATH DE number 874530 (Why is no real title available?)
- scientific article; zbMATH DE number 874541 (Why is no real title available?)
- Hadamard equivalence via graph isomorphism
- Hadamard ideals and Hadamard matrices with two circulant cores
- Inequivalent Hadamard matrices of order \(2n\) constructed from Hadamard matrices of order \(n\)
- Inequivalent Hadamard matrices with buckets
- Large orthogonal designs via amicable sets of matrices
- Metasoftware for Hadamard matrices
- New skew-Hadamard matrices via computational algebra
- New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
Cited in
(3)
This page was built for publication: Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972300)