Abstract
We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = 4t, 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 4t ≥ 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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Álvarez, V., Armario, J. A., Frau, M. D., & Real, P. (2006). Calculating cocyclic Hadamard matrices in mathematica: Exhaustive and heuristic searches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4151 LNCS, pp. 419–422). Springer Verlag. https://doi.org/10.1007/11832225_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
