Repositorio de producción científica de la Universidad de Sevilla

A Mixed Heuristic for Generating Cocyclic Hadamard Matrices

 

Advanced Search
 
Acceso restringido A Mixed Heuristic for Generating Cocyclic Hadamard Matrices
Cites

Show item statistics
Icon
Export to
Author: Álvarez Solano, Víctor
Armario Sampalo, José Andrés
Falcón Ganfornina, Raul Manuel
Frau García, María Dolores
Gudiel Rodríguez, Félix
Güemes Alzaga, María Belén
Osuna Lucena, Amparo
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de álgebra
Date: 2018
Published in: Mathematics in Computer Science, 12 (4), 407-417.
Document type: Article
Abstract: A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion of fitness, and a peculiar local search, defined as a constraint satisfaction problem. Calculations support the idea that finding a cocyclic Hadamard matrix of order 4 · 47 might be within reach, for the first time, progressing further upon the ideas explained in this work.
Cite: Álvarez Solano, V., Armario Sampalo, J.A., Falcón Ganfornina, R.M., Frau García, M.D., Gudiel Rodríguez, F., Güemes Alzaga, M.B. y Osuna Lucena, A. (2018). A Mixed Heuristic for Generating Cocyclic Hadamard Matrices. Mathematics in Computer Science, 12 (4), 407-417.
Size: 216.8Kb
Format: PDF

URI: https://hdl.handle.net/11441/87396

DOI: 10.1007/s11786-018-0377-x

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)