2009 | OriginalPaper | Buchkapitel
Rooted Trees Searching for Cocyclic Hadamard Matrices over D 4t
verfasst von : Víctor Álvarez, José Ándrés Armario, María Dolores Frau, Félix Gudiel, Amparo Osuna
Erschienen in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.