1. RUA
  2. Investigación
  3. Grupo de Álgebra y Geometría (GAG)
  4. INV - GAG - Artículos de Revistas

Optimum distance flag codes from spreads via perfect matchings in graphs

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10045/119628
EstadísticasEstadísticas
Registro completo de metadatos
Registro completo de metadatos
Campo DCValorIdioma
dc.contributorGrupo de Álgebra y Geometría (GAG)es_ES
dc.contributor.authorAlonso-González, Clementa-
dc.contributor.authorNavarro-Pérez, Miguel Ángel-
dc.contributor.authorSoler-Escrivà, Xaro-
dc.contributor.otherUniversidad de Alicante. Departamento de Matemáticases_ES
dc.date.accessioned2021-11-22T11:18:29Z-
dc.date.available2021-11-22T11:18:29Z-
dc.date.issued2021-11-19-
dc.identifier.citationJournal of Algebraic Combinatorics. 2021, 54: 1279-1297. https://doi.org/10.1007/s10801-021-01086-yes_ES
dc.identifier.issn0925-9899 (Print)-
dc.identifier.issn1572-9192 (Online)-
dc.identifier.urihttp://hdl.handle.net/10045/119628-
dc.description.abstractIn this paper, we study flag codes on the vector space Fnq, being q a prime power and Fq the finite field of q elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum distance flag codes) and can be obtained from a spread of Fnq. We characterize the set of admissible type vectors for this family of flag codes and also provide a construction of them based on well-known results about perfect matchings in graphs. This construction attains both the maximum distance for its type vector and the largest possible cardinality for that distance.es_ES
dc.description.sponsorshipOpen Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. The authors receive financial support from Ministerio de Ciencia e Innovación PID2019-108668GB-I00 (Spain). The first and third authors are partially supported by Projecte AICO/2017/128 of Generalitat Valenciana (Spain). The second author is supported by Generalitat Valenciana and Fondo Social Europeo, grant number: ACIF/2018/196 (Spain).es_ES
dc.languageenges_ES
dc.publisherSpringer Naturees_ES
dc.rights© The Author(s) 2021. Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.es_ES
dc.subjectNetwork codinges_ES
dc.subjectSubspace codeses_ES
dc.subjectSpreadses_ES
dc.subjectFlag codeses_ES
dc.subjectGraphses_ES
dc.subjectPerfect matchinges_ES
dc.subject.otherGeometría y Topologíaes_ES
dc.subject.otherÁlgebraes_ES
dc.titleOptimum distance flag codes from spreads via perfect matchings in graphses_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.peerreviewedsies_ES
dc.identifier.doi10.1007/s10801-021-01086-y-
dc.relation.publisherversionhttps://doi.org/10.1007/s10801-021-01086-yes_ES
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses_ES
dc.relation.projectIDinfo:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-108668GB-I00es_ES
Aparece en las colecciones:INV - GAG - Artículos de Revistas

Archivos en este ítem:
Archivos en este ítem:
Archivo Descripción TamañoFormato 
ThumbnailAlonso-Gonzalez_etal_2021_JAlgebrComb.pdf291,23 kBAdobe PDFAbrir Vista previa
Muestra el registro sencillo


Este ítem está licenciado bajo Licencia Creative Commons Creative Commons