2006 | OriginalPaper | Chapter
Calculating Cocyclic Hadamard Matrices in Mathematica: Exhaustive and Heuristic Searches
Authors : V. Álvarez, J. A. Armario, M. D. Frau, P. Real
Published in: Mathematical Software - ICMS 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We describe a notebook in
Mathematica
which, taking as input data a homological model for a finite group
G
of order |
G
| = 4
t
, performs an exhaustive search for constructing the whole set of cocyclic Hadamard matrices over
G
. Since such an exhaustive search is not practical for orders 4
t
≥28, the program also provides an alternate method, in which an heuristic search (in terms of a genetic algorithm) is performed. We include some executions and examples.