1 research outputs found
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 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.Ministerio de Ciencia e Innovación MTM2008-06578Junta de Andalucía FQM–296Junta de Andalucía P07-FQM-0298