Advertisement
Published in:
2009 | OriginalPaper | Chapter
Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t
Authors : Víctor Álvarez, José Ándrés Armario, María Dolores Frau, Félix Gudiel, Amparo Osuna
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups
D
4
t
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.