Buscar
Mostrando ítems 1-10 de 12
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
An algorithm for computing the first homology groups of CDGAs with linear differential
(Research Institute for Symbolic Computation, 1999)
We design here a primary platform for computing the basic homological information of Commutative Differential Graded Algebras (brie y, CDGAs), endowed with linear differential. All the algorithms have been implemented ...
Ponencia
Ponencia
Searching for partial Hadamard matrices
(Universidade de Santiago de Compostela, Servicio de Publicaciones, 2010)
Three algorithms looking for pretty large partial Hadamard ma- trices are described. Here “large” means that hopefully about a third of a Hadamard matrix (which is the best asymptotic result known so far, [8]) is achieved. ...
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
(Pseudo)-cocyclic (structured) Hadamard matrices over (quasi)groups
(2017)
Progressing on a survey of the state of the art of cocyclic constructions for Hadamard matrices, we will prove that the family of Goethals-Seidel Hadamard matrices is (pseudo)-cocyclic over a certain family of quasigroups. ...
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
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 ...
Ponencia
Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
(2017-07)
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard Graph Δ(4t) [9]. The key idea is translating the problem of extending a given clique Cm to a larger ...