Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques
DOI10.1016/J.APNUM.2009.06.002zbMATH Open1219.05028OpenAlexW2082828794MaRDI QIDQ972300FDOQ972300
Authors: Dimitris Simos, Christos Koukouvinos 
Publication date: 25 May 2010
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apnum.2009.06.002
Recommendations
Applications of mathematical programming (90C90) Boolean and Hadamard matrices (15B34) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
- Hadamard equivalence via graph isomorphism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inequivalent Hadamard matrices of order \(2n\) constructed from Hadamard matrices of order \(n\)
- Title not available (Why is that?)
- Hadamard ideals and Hadamard matrices with two circulant cores
- New skew-Hadamard matrices via computational algebra
- Title not available (Why is that?)
- Inequivalent Hadamard matrices with buckets
- Large orthogonal designs via amicable sets of matrices
- Metasoftware for Hadamard matrices
Cited In (3)
Uses Software
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)
