Publication: Optimum distance flag codes from spreads via perfect matchings in graphs
dc.affiliation.dpto | UC3M. Departamento de Matemáticas | es |
dc.contributor.author | Alonso-González, Clementa | |
dc.contributor.author | Navarro Pérez, Miguel Ángel | |
dc.contributor.author | Soler-Escrivá, Xaro | |
dc.contributor.funder | Ministerio de Ciencia e Innovación (España) | es |
dc.date.accessioned | 2023-05-23T12:13:38Z | |
dc.date.available | 2023-05-23T12:13:38Z | |
dc.date.issued | 2021-12 | |
dc.description.abstract | 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. | en |
dc.description.sponsorship | 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). | en |
dc.format.extent | 19 | |
dc.identifier.bibliographicCitation | Alonso-González, C., Navarro-Pérez, M. Á., & Soler-Escrivà, X. (2021). Optimum distance flag codes from spreads via perfect matchings in graphs. Journal of Algebraic Combinatorics, 54(4), 1279-1297. | en |
dc.identifier.doi | https://doi.org/10.1007/s10801-021-01086-y | |
dc.identifier.issn | 0925-9899 | |
dc.identifier.publicationfirstpage | 1279 | |
dc.identifier.publicationissue | 4 | |
dc.identifier.publicationlastpage | 1297 | |
dc.identifier.publicationtitle | Journal of Algebraic Combinatorics | en |
dc.identifier.publicationvolume | 54 | |
dc.identifier.uri | https://hdl.handle.net/10016/37346 | |
dc.identifier.uxxi | AR/0000033012 | |
dc.language.iso | eng | |
dc.relation.projectID | Gobierno de España. PID2019-108668GB-I00 | es |
dc.rights | © The Author(s) 2021 | en |
dc.rights | Atribución 3.0 España | * |
dc.rights.accessRights | open access | en |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ | * |
dc.subject.eciencia | Matemáticas | es |
dc.subject.other | Network coding | en |
dc.subject.other | Subspace codes | en |
dc.subject.other | Spreads | en |
dc.subject.other | Flag codes | en |
dc.subject.other | Graphs | en |
dc.subject.other | Perfect matching | en |
dc.title | Optimum distance flag codes from spreads via perfect matchings in graphs | en |
dc.type | research article | * |
dc.type.hasVersion | VoR | * |
dspace.entity.type | Publication |
Files
Original bundle
1 - 1 of 1