Buscar
Mostrando ítems 1-4 de 4
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
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
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 ...