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
Título: | Optimum distance flag codes from spreads via perfect matchings in graphs |
---|---|
Autor/es: | Alonso-González, Clementa | Navarro-Pérez, Miguel Ángel | Soler-Escrivà, Xaro |
Grupo/s de investigación o GITE: | Grupo de Álgebra y Geometría (GAG) |
Centro, Departamento o Servicio: | Universidad de Alicante. Departamento de Matemáticas |
Palabras clave: | Network coding | Subspace codes | Spreads | Flag codes | Graphs | Perfect matching |
Área/s de conocimiento: | Geometría y Topología | Álgebra |
Fecha de publicación: | 19-nov-2021 |
Editor: | Springer Nature |
Cita bibliográfica: | Journal of Algebraic Combinatorics. 2021, 54: 1279-1297. https://doi.org/10.1007/s10801-021-01086-y |
Resumen: | In 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. |
Patrocinador/es: | Open 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). |
URI: | http://hdl.handle.net/10045/119628 |
ISSN: | 0925-9899 (Print) | 1572-9192 (Online) |
DOI: | 10.1007/s10801-021-01086-y |
Idioma: | eng |
Tipo: | info:eu-repo/semantics/article |
Derechos: | © 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/. |
Revisión científica: | si |
Versión del editor: | https://doi.org/10.1007/s10801-021-01086-y |
Aparece en las colecciones: | INV - GAG - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Alonso-Gonzalez_etal_2021_JAlgebrComb.pdf | 291,23 kB | Adobe PDF | Abrir Vista previa | |
Este ítem está licenciado bajo Licencia Creative Commons