Latin squares are used as scramblers on symmetric-key algorithms that generate pseudo-random sequences of the same length. The robustness and effectiveness of these algorithms are respectively based on the extremely large ...

A genetic algorithm for constructing cocyclic Hadamard matrices over a given group is described. The novelty of this algorithm is the guided heuristic procedure for reproduction, instead of the classical crossover and ...

A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion of fitness, and a peculiar local search, defined as a constraint satisfaction problem. Calculations ...

An algorithm for calculating a set ofgenerators ofrepresentative 2-cocycles on semidirect product offinite abelian groups is constructed, in light ofthe theory over cocyclic matrices developed by Horadam and de Launey in ...

Let Λ be a commutative ring, A an augmented differential graded algebra over Λ (briefly, DGA-algebra) and X be a relatively free resolution of Λ over A. The standard bar resolution of Λ over A, denoted by B(A), provides ...

We use homological perturbation machinery specific for the algebra category [13] to give an algorithm for computing the differential structure of a small 1– homological model for commutative differential graded algebras ...

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. The largest possible determinant of such a matrix K is an interesting problem. The literature ...

One of the most promising structural approaches to resolving the Hadamard Conjecture uses the family of cocyclic matrices over Zt × Z2 2. Two types of equivalence relations for classifying cocyclic matrices over Zt × ...

A genetic algorithm based robust blind digital watermarking scheme is presented. The experimental results show that our scheme keeps invisibility, security and robustness more likely than other proposals in the literature, ...