Publication:
Optimum distance flag codes from spreads via perfect matchings in graphs

Simple item page
dc.affiliation.dptoUC3M. Departamento de Matemáticases
dc.contributor.authorAlonso-González, Clementa
dc.contributor.authorNavarro Pérez, Miguel Ángel
dc.contributor.authorSoler-Escrivá, Xaro
dc.contributor.funderMinisterio de Ciencia e Innovación (España)es
dc.date.accessioned2023-05-23T12:13:38Z
dc.date.available2023-05-23T12:13:38Z
dc.date.issued2021-12
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.en
dc.description.sponsorshipThe 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.extent19
dc.identifier.bibliographicCitationAlonso-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.doihttps://doi.org/10.1007/s10801-021-01086-y
dc.identifier.issn0925-9899
dc.identifier.publicationfirstpage1279
dc.identifier.publicationissue4
dc.identifier.publicationlastpage1297
dc.identifier.publicationtitleJournal of Algebraic Combinatoricsen
dc.identifier.publicationvolume54
dc.identifier.urihttps://hdl.handle.net/10016/37346
dc.identifier.uxxiAR/0000033012
dc.language.isoeng
dc.relation.projectIDGobierno de España. PID2019-108668GB-I00es
dc.rights© The Author(s) 2021en
dc.rightsAtribución 3.0 España*
dc.rights.accessRightsopen accessen
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/es/*
dc.subject.ecienciaMatemáticases
dc.subject.otherNetwork codingen
dc.subject.otherSubspace codesen
dc.subject.otherSpreadsen
dc.subject.otherFlag codesen
dc.subject.otherGraphsen
dc.subject.otherPerfect matchingen
dc.titleOptimum distance flag codes from spreads via perfect matchings in graphsen
dc.typeresearch article*
dc.type.hasVersionVoR*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Optimum_JAC_2021.pdf
Size:
272.88 KB
Format:
Adobe Portable Document Format
Download
Collections
DM - Artículos de Revistas