Heuristic algorithms for hadamard matrices with two circulant cores



We design heuristic algorithms to construct Hadamard matrices with two circulant cores. This hard combinatorial problem can be formulated in terms of objective functions of several binary variables, so that heuristic methodologies can be used. Our algorithms are based on local and tabu search and they use information on the geometry of the objective function landscapes. In addition, we use the supplementary difference sets formalism to detect when solutions of a special structure exist. Using these algorithms we have computed at least one Hadamard matrix with two circulant cores of the sixteen orders 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116. In particular, the Hadamard matrix with two circulant cores of order 116 is constructed here for the first time, indeed it was accidentally reported as known in an earlier paper.


Theoretical Computer Science, Vol. 407, #1-3, pp. 274-277, November 2008

Cited by

Year 2015 : 1 citations

 Yuan-Lung Lin and Frederick Kin Hing Phoa
Constructing near-Hadamard designs with (almost) D-optimality by General Supplementary Difference Sets (GSDS)s
Statistica Sinica Preprint No: SS-2014-0115R3, 2015