Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself ...

About twenty-five years ago, Horadam and de Launey introduced the cocyclic development of designs, from which the notion ...

Latin squares are used as scramblers on symmetric-key algorithms that generate pseudo-random sequences of the same length. ...

In the literature, the theory of cocyclic Hadamard matrices has always been developed over finite groups. This paper ...

This paper deals with partial binary Hadamard matrices. Although there is a fast simple way to generate about a half (which ...

A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion ...

Hadamard ideals were introduced in 2006 as a set of nonlin-ear polynomial equations whose zeros are uniquely related ...

A genetic algorithm based robust blind digital watermarking scheme is presented. The experimental results show that our ...

A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard ...

Progressing on a survey of the state of the art of cocyclic constructions for Hadamard matrices, we will prove that the ...

In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yield a cocyclic Hadamard ...

A characterization of ZZt × ZZ22 -cocyclic Hadamard matrices is described, de- pending on the notions of distributions, ...

An n by n skew-symmetric type (−1, 1)-matrix K = [ki,j ] has 1’s on the main diagonal and ±1’s elsewhere with ki,j = −kj,i. ...

Provided that a cohomological model for G is known, we describe a method for constructing a basis for n-cocycles over G, ...

One of the most promising structural approaches to resolving the Hadamard Conjecture uses the family of cocyclic matrices ...

A method for embedding cocyclic submatrices with “large” determinants of orders 2t in certain cocyclic Hadamard matrices ...

Let G be a semidirect product of finitely generated Abelian groups. We provide a method for constructing an explicit ...

Cocyclic construction has been successfully used for Hadamard matrices of order n. These -matrices satisfy that and give ...

Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” means that hopefully ...

An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D4t is described. The underlying ...

For a simplicial augmented algebra K, Eilenberg–Mac Lane constructed a chain map . They proved that g is a reduction ...

An alternate method for constructing (Hadamard) cocyclic matrices over a finite group GG is described. Provided that a ...

A genetic algorithm for constructing cocyclic Hadamard matrices over a given group is described. The novelty of this ...

A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in ...

Given a basis equation image for 2-cocycles equation image over a group G of order equation image, we describe a nonlinear ...

Levenshtein described in [5] a method for constructing error correcting codes which meet the Plotkin bounds, provided ...

Let G, G′, and G ×τ G′ be three simplicial groups (not necessarily abelian) and C N (G) ⊗ t C N (G′) be the “twisted” ...

Let G be a group which admits the structure of an iterated product of central extensions and semidirect products of abelian ...

We describe a notebook in Mathematica which, taking as input data a homological model for a finite group G of order |G| = ...

A genetic algorithm for finding cocyclic Hadamard matrices is described. Though we focus on the case of dihedral groups, ...

Let Λ be a commutative ring, A an augmented differential graded algebra over Λ (briefly, DGA-algebra) and X be a relatively ...

This review tackles the problem of the high computational complexity lying in most algorithms in algebraic topology and ...

En este art´ıculo, se pretende dar una visi´on general y lo m´as divulgativa posible sobre los prop´ositos y objetivos del ...

An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product offinite abelian groups ...

We use homological perturbation machinery specific for the algebra category [13] to give an algorithm for computing the ...

We design here a primary platform for computing the basic homological information of Commutative Differential Graded ...

Working in the framework of the Simplicial Topology, a method for calculating the p-local homology of a twisted cartesian ...

We establish an algorithm computing the homology of commutative differential graded algebras (briefly, CDGAs). The main ...