Hadamard ideals and Hadamard matrices with two circulant cores

Authors:
Ilias S. Kotsireas;Christos Koukouvinos;Jennifer Seberry
Affiliations:
Wilfrid Laurier University, Department of Physics and Computer Science, Waterloo, Ontario, Canada;Department of Mathematics, National Technical University of Athens, Zografou, Athens, Greece;Centre for Computer Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, NSW, Australia
Venue:
European Journal of Combinatorics
Year:
2006

Citing 2
Cited 3

Number theory in science and communication

Number theory in science and communication
Hadamard matrices, orthogonal designs and construction algorithms

DESIGNS 2002

ECCAD 2007 poster abstracts

ACM Communications in Computer Algebra
Heuristic algorithms for Hadamard matrices with two circulant cores

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

Applied Numerical Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply computational algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamard ideal, to systematize the application of computational algebra methods for this construction. We use the Hadamard ideal formalism to perform exhaustive search constructions of Hadamard matrices with two circulant cores for the twelve orders 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52. The total number of such Hadamard matrices is proportional to the square of the parameter. We use the Hadamard ideal formalism to compute the proportionality constants for the twelve orders listed above. Finally, we use the Hadamard ideal formalism to improve the lower bounds for the number of inequivalent Hadamard matrices for the seven orders 44, 48, 52, 56, 60, 64, 68.