Perfil del autor: Osuna Lucena, Amparo
Datos institucionales
Nombre | Osuna Lucena, Amparo |
Departamento | Matemática Aplicada I |
Área de conocimiento | Matemática Aplicada |
Categoría profesional | Profesora Titular de Universidad |
Correo electrónico | Solicitar |
Estadísticas
-
Nº publicaciones
12
-
Nº visitas
965
-
Nº descargas
948
Publicaciones |
---|
Artículo
Hadamard Matrices with Cocyclic Core
(MDPI, 2021)
Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself ... |
Artículo
On Cocyclic Hadamard Matrices over Goethals-Seidel Loops
(MDPI, 2020)
About twenty-five years ago, Horadam and de Launey introduced the cocyclic development of designs, from which the notion ... |
Artículo
Generating binary partial Hadamard matrices
(Elsevier, 2019)
This paper deals with partial binary Hadamard matrices. Although there is a fast simple way to generate about a half (which ... |
Artículo
A Mixed Heuristic for Generating Cocyclic Hadamard Matrices
(Springer, 2018)
A way of generating cocyclic Hadamard matrices is described, which combines a new heuristic, coming from a novel notion ... |
Artículo
GA Based Robust Blind Digital Watermarking
(Elsevier, 2018)
A genetic algorithm based robust blind digital watermarking scheme is presented. The experimental results show that our ... |
Ponencia
Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
(2017)
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard ... |
Artículo
On D4t-Cocyclic Hadamard Matrices
(Wiley, 2016)
In this paper, we describe some necessary and sufficient conditions for a set of coboundaries to yield a cocyclic Hadamard ... |
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 ... |
Ponencia
ACS Searching for D4t-Hadamard Matrices
(Springer, 2010)
An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D4t is described. The underlying ... |
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 ... |
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 ... |
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 ... |