Improving the lower bounds on inequivalent Hadamard matrices through orthogonal designs and meta-programming techniques

Authors:
Christos Koukouvinos;Dimitris E. Simos
Affiliations:
Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece;Department of Mathematics, National Technical University of Athens, Zografou 15773, Athens, Greece
Venue:
Applied Numerical Mathematics
Year:
2010

Citing 4
Cited 0

Software reuse

ACM Computing Surveys (CSUR)
Introduction to Algorithms

Introduction to Algorithms
Hadamard ideals and Hadamard matrices with two circulant cores

European Journal of Combinatorics
Inequivalent Hadamard matrices from orthogonal designs

Proceedings of the 2007 international workshop on Parallel symbolic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we construct inequivalent Hadamard matrices based on several new and old full orthogonal designs, using circulant and symmetric block matrices. Not all orthogonal designs produce inequivalent Hadamard matrices, because the corresponding systems of equations do not possess solutions. In addition, we give some new constructions for orthogonal designs derived from sequences with zero autocorrelation. The orthogonal designs used to construct the inequivalent Hadamard matrices are produced from theoretical and algorithmic constructions.