Heuristic algorithms for Hadamard matrices with two circulant cores
From MaRDI portal
Publication:955002
DOI10.1016/j.tcs.2008.06.002zbMath1153.65043OpenAlexW2058095168MaRDI QIDQ955002
Ilias S. Kotsireas, Christos Koukouvinos, Luís Paquete, Marco Chiarandini
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.002
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics ⋮ Geometric search for Hadamard matrices ⋮ Legendre G‐array pairs and the theoretical unification of several G‐array families ⋮ A Legendre pair of length 77 using complementary binary matrices with fixed marginals
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Supplementary difference sets and D-optimal designs for n\(\equiv 2\) mod 4
- A note on supplementary difference sets
- Hadamard ideals and Hadamard matrices with two circulant cores
- Cyclic difference sets
- On supplementary difference sets
- Comparison of iterative searches for the quadratic assignment problem
- Genetic algorithms for the construction of Hadamard matrices with two circulant cores
This page was built for publication: Heuristic algorithms for Hadamard matrices with two circulant cores
