Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t

Álvarez Solano, Víctor; Armario Sampalo, José Andrés; Frau García, María Dolores; Gudiel Rodríguez, Félix; Osuna Lucena, Amparo

doi:10.1007/978-3-642-02181-7_22

Ponencia

dc.creator	Álvarez Solano, Víctor	es
dc.creator	Armario Sampalo, José Andrés	es
dc.creator	Frau García, María Dolores	es
dc.creator	Gudiel Rodríguez, Félix	es
dc.creator	Osuna Lucena, Amparo	es
dc.date.accessioned	2019-06-14T06:50:53Z
dc.date.available	2019-06-14T06:50:53Z
dc.date.issued	2009
dc.identifier.citation	Álvarez Solano, V., Armario Sampalo, J.A., Frau García, M.D., Gudiel Rodríguez, F. y Osuna Lucena, A. (2009). Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t. En AAECC 2009 : 18th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (204-214), Tarragona, España: Springer.
dc.identifier.isbn	978-3-642-02180-0	es
dc.identifier.issn	0302-9743	es
dc.identifier.uri	https://hdl.handle.net/11441/87428
dc.description.abstract	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 consisting of two rooted trees (the vertices representing subsets of coboundaries) which contains all cocyclic Hadamard matrices satisfying the constraining condition. Experimental calculations indicate that the ratio between the number of constrained cocyclic Hadamard matrices and the size of the constrained search space is greater than the usual ratio.	es
dc.description.sponsorship	Ministerio de Ciencia e Innovación MTM2008-06578	es
dc.description.sponsorship	Junta de Andalucía FQM–296	es
dc.description.sponsorship	Junta de Andalucía P07-FQM-02980	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Springer	es
dc.relation.ispartof	AAECC 2009 : 18th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (2009), p 204-214
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.subject	Hadamard matrix	es
dc.subject	Cocyclic matrix	es
dc.subject	Dihedral groups	es
dc.title	Rooted Trees Searching for Cocyclic Hadamard Matrices over D4t	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dcterms.identifier	https://ror.org/03yxnpp24
dc.type.version	info:eu-repo/semantics/submittedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess	es
dc.contributor.affiliation	Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)	es
dc.relation.projectID	MTM2008-06578	es
dc.relation.projectID	FQM-296	es
dc.relation.projectID	P07-FQM-02980	es
dc.relation.publisherversion	https://link.springer.com/chapter/10.1007/978-3-642-02181-7_22	es
dc.identifier.doi	10.1007/978-3-642-02181-7_22	es
idus.format.extent	11	es
dc.publication.initialPage	204	es
dc.publication.endPage	214	es
dc.eventtitle	AAECC 2009 : 18th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes	es
dc.eventinstitution	Tarragona, España	es
dc.relation.publicationplace	Berlin	es

Ficheros	Tamaño	Formato	Ver	Descripción
Rooted Trees Searching.pdf	307.1Kb	[PDF]	Ver/Abrir

Este registro aparece en las siguientes colecciones

Ponencias (Matemática Aplicada I)

Mostrar el registro sencillo del ítem

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional