论文信息 - Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t

Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t

A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D 4t 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.

V. Álvarez | J. Armario | M. Frau | F. Gudiel | A. Osuna

[1] Víctor Álvarez,et al. The homological reduction method for computing cocyclic Hadamard matrices , 2009, J. Symb. Comput..

[2] K. J. Horadam,et al. Generation of Cocyclic Hadamard Matrices , 1995 .

[3] W. Wallis,et al. Hadamard Matrices and Their Applications , 1978 .

[4] Víctor Álvarez,et al. A Genetic Algorithm for Cocyclic Hadamard Matrices , 2006, AAECC.

[5] Wieb Bosma,et al. Computational Algebra and Number Theory , 1995 .

[6] D. Flannery,et al. Cocyclic Hadamard Matrices and Hadamard Groups Are Equivalent , 1997 .

[7] Noboru Ito,et al. Hadamard graphs. I , 1985, Graphs Comb..

[8] Shu Lin,et al. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , 1999, Lecture Notes in Computer Science.

[9] K. J. Horadam,et al. Cocyclic Development of Designs , 1993 .

[10] Víctor Álvarez,et al. A system of equations for describing cocyclic Hadamard matrices , 2008 .

[11] S. Agaian. Hadamard Matrices and Their Applications , 1985 .

[12] Víctor Álvarez,et al. A Heuristic Procedure with Guided Reproduction for Constructing Cocyclic Hadamard Matrices , 2009, ICANNGA.

[13] A. Baliga,et al. Self-dual Codes Using Image Restoration Techniques , 2001, AAECC.

[14] Noboru Ito,et al. On Hadamard Groups , 1994 .