2015-12-092015-12-092006http://hdl.handle.net/11441/31610We 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 examplesapplication/pdfengAtribución-NoComercial-CompartirIgual 4.0 Internacionalhttp://creativecommons.org/licenses/by-nc-sa/4.0/Numeric ComputingDiscrete Mathematics in Computer ScienceSymbolic and Algebraic ManipulationAlgorithm Analysis and Problem ComplexityMathematical SoftwareAlgorithmsinfo:eu-repo/semantics/bookPartinfo:eu-repo/semantics/openAccesshttp://dx.doi.org/10.1007/11832225_42https://idus.us.es/xmlui/handle/11441/31610