Show simple item record

dc.creatorÁlvarez Solano, Víctores
dc.creatorArmario Sampalo, José Andréses
dc.creatorFrau García, María Doloreses
dc.creatorGudiel Rodríguez, Félixes
dc.creatorOsuna Lucena, Amparoes
dc.date.accessioned2019-06-14T06:50:53Z
dc.date.available2019-06-14T06:50:53Z
dc.date.issued2009
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.isbn978-3-642-02180-0es
dc.identifier.issn0302-9743es
dc.identifier.urihttps://hdl.handle.net/11441/87428
dc.description.abstractA 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.sponsorshipMinisterio de Ciencia e Innovación MTM2008-06578es
dc.description.sponsorshipJunta de Andalucía FQM–296es
dc.description.sponsorshipJunta de Andalucía P07-FQM-02980es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherSpringeres
dc.relation.ispartofAAECC 2009 : 18th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (2009), p 204-214
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectHadamard matrixes
dc.subjectCocyclic matrixes
dc.subjectDihedral groupses
dc.titleRooted Trees Searching for Cocyclic Hadamard Matrices over D4tes
dc.typeinfo:eu-repo/semantics/conferenceObjectes
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)es
dc.relation.projectIDMTM2008-06578es
dc.relation.projectIDFQM-296es
dc.relation.projectIDP07-FQM-02980es
dc.relation.publisherversionhttps://link.springer.com/chapter/10.1007/978-3-642-02181-7_22es
dc.identifier.doi10.1007/978-3-642-02181-7_22es
idus.format.extent11es
dc.publication.initialPage204es
dc.publication.endPage214es
dc.eventtitleAAECC 2009 : 18th International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codeses
dc.eventinstitutionTarragona, Españaes
dc.relation.publicationplaceBerlines

FilesSizeFormatViewDescription
Rooted Trees Searching.pdf307.1KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional