In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yield a cocyclic Hadamard matrix over the dihedral group D4t. Using this characterization, new classification results for certain cohomology classes of cocycles over D4t are obtained, extending existing exhaustive calculations for cocyclic Hadamard matrices over D4t from order 36 to order 44. We also define some transformations over coboundaries, which preserve orthogonality of D4t -cocycles. These transformations are shown to correspond to Horadam’s bundle equivalence operations enriched with duals of cocycles.Junta de Andalucía FQM-01
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case...
A characterization of ZZt × ZZ22 -cocyclic Hadamard matrices is described, de- pending on the noti...
This thesis is a compilation of results dealing with cocyclic development of pairwise combinatorial ...
One of the most promising structural approaches to resolving the Hadamard Conjecture uses the famil...
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s...
AbstractIn this paper, we prove that the concepts of cocyclic Hadamard matrix and Hadamard group are...
Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are ...
Provided that a cohomological model for G is known, we describe a method for constructing a basis fo...
Given two Hadamard matrices of the same order, it can be quite difficult to decide whether or not t...
Abstract. Given a basis B = {f1,..., fk} for 2-cocycles f: G×G → {±1} over a group G of order |G | ...
A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming ...
AbstractMany codes and sequences designed for robust or secure communications are built from Hadamar...
AbstractThis paper locates cocyclic Hadamard matrices within the mainstream of combinatorial design ...
An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product of...
AbstractLet q be an odd natural number. We prove there is a cocyclic Hadamard matrix of order 210+tq...
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case...
A characterization of ZZt × ZZ22 -cocyclic Hadamard matrices is described, de- pending on the noti...
This thesis is a compilation of results dealing with cocyclic development of pairwise combinatorial ...
One of the most promising structural approaches to resolving the Hadamard Conjecture uses the famil...
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s...
AbstractIn this paper, we prove that the concepts of cocyclic Hadamard matrix and Hadamard group are...
Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are ...
Provided that a cohomological model for G is known, we describe a method for constructing a basis fo...
Given two Hadamard matrices of the same order, it can be quite difficult to decide whether or not t...
Abstract. Given a basis B = {f1,..., fk} for 2-cocycles f: G×G → {±1} over a group G of order |G | ...
A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming ...
AbstractMany codes and sequences designed for robust or secure communications are built from Hadamar...
AbstractThis paper locates cocyclic Hadamard matrices within the mainstream of combinatorial design ...
An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product of...
AbstractLet q be an odd natural number. We prove there is a cocyclic Hadamard matrix of order 210+tq...
A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case...
A characterization of ZZt × ZZ22 -cocyclic Hadamard matrices is described, de- pending on the noti...
This thesis is a compilation of results dealing with cocyclic development of pairwise combinatorial ...