Ponencia
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
Autor/es | Álvarez Solano, Víctor
Armario Sampalo, José Andrés Frau García, María Dolores Gudiel Rodríguez, Félix Osuna Lucena, Amparo |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2009 |
Fecha de depósito | 2019-06-14 |
Publicado en |
|
ISBN/ISSN | 978-3-642-02180-0 0302-9743 |
Resumen | A new reduction on the size of the search space for cocyclic
Hadamard matrices over dihedral groups D4t is described, in terms of the
so called central distribution. This new search space adopt the form of a
forest ... A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new search space adopt the form of a forest consisting of two rooted trees (the vertices representing subsets of coboundaries) which contains all cocyclic Hadamard matrices satisfying the constraining condition. Experimental calculations indicate that the ratio between the number of constrained cocyclic Hadamard matrices and the size of the constrained search space is greater than the usual ratio. |
Identificador del proyecto | MTM2008-06578
FQM-296 P07-FQM-02980 |
Cita | Álvarez Solano, V., Armario Sampalo, J.A., Frau García, M.D., Gudiel Rodríguez, F. y Osuna Lucena, A. (2009). Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t. En AAECC 2009 : 18th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (204-214), Tarragona, España: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Rooted Trees Searching.pdf | 307.1Kb | [PDF] | Ver/ | |