Show simple item record

dc.contributor.authorJohnsen, Trygve
dc.contributor.authorVerdure, Hugues
dc.date.accessioned2022-06-13T09:32:24Z
dc.date.available2022-06-13T09:32:24Z
dc.date.issued2020-12-19
dc.description.abstractWe introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are associated to linear codes, our definitions coincide with those for codes. Thus our Wei duality is a generalization of that for linear codes given by Schaathun. In the last part of the paper we show how some important chains of cycles of the matroids appearing, correspond to chains of component maps of minimal resolutions of the independence complex of the corresponding matroids. We also relate properties of these resolutions to chainedness and greedy weights of the matroids, and in many cases codes, that appear.en_US
dc.identifier.citationJohnsen, T., Verdure, H. Greedy weights for matroids. Des. Codes Cryptogr. 89, 387–405 (2021)en_US
dc.identifier.cristinIDFRIDAID 1874966
dc.identifier.doi10.1007/s10623-020-00824-w
dc.identifier.issn0925-1022
dc.identifier.issn1573-7586
dc.identifier.urihttps://hdl.handle.net/10037/25455
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.journalDesigns, Codes and Cryptography
dc.rights.accessRightsopenAccessen_US
dc.rights.holderCopyright 2020 The Author(s)en_US
dc.titleGreedy weights for matroidsen_US
dc.type.versionpublishedVersionen_US
dc.typeJournal articleen_US
dc.typeTidsskriftartikkelen_US
dc.typePeer revieweden_US


File(s) in this item

Thumbnail

This item appears in the following collection(s)

Show simple item record