Buscar
Mostrando ítems 1-5 de 5
Ponencia
Error correcting codes from quasi-Hadamard matrices
(Springer, 2007)
Levenshtein described in [5] a method for constructing error correcting codes which meet the Plotkin bounds, provided suitable Ha- damard matrices exist. Uncertainty about the existence of Hadamard matrices on all orders ...
Ponencia
A Heuristic Procedure with Guided Reproduction for Constructing Cocyclic Hadamard Matrices
(Springer, 2009)
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 ...
Ponencia
El Proyecto CHATA
(Universidad de Sevilla, 2001)
En este art´ıculo, se pretende dar una visi´on general y lo m´as divulgativa posible sobre los prop´ositos y objetivos del proyecto de investigaci´on CHATA (Computational Homological Algebra and Algebraic Topology and ...
Ponencia
Computing “Small” 1–Homological Models for Commutative Differential Graded Algebras
(Springer, 2000)
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 ...
Ponencia
Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t
(Springer, 2009)
A new reduction on the size of the search space for cocyclic Hadamard matrices over dihedral groups D4t is described, in terms of the so called central distribution. This new search space adopt the form of a forest ...