Vis enkel innførsel

dc.contributor.authorJohnsen, Trygve
dc.contributor.authorVerdure, Hugues
dc.date.accessioned2018-03-22T07:04:28Z
dc.date.available2018-03-22T07:04:28Z
dc.date.issued2017-08-23
dc.description.abstractThis paper is devoted to giving a generalization from linear codes to the larger class of almost affine codes of two different results. One such result is how one can express the relative generalized Hamming weights of a pair of codes in terms of intersection properties between the smallest of these codes and subcodes of the largest code. The other result tells how one can find the extended weight polynomials, expressing the number of codewords of each possible weight, for each code in an infinite hierarchy of extensions of a code over a given alphabet. Our tools will be demi-matroids and matroids.en_US
dc.descriptionThis is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science, International Castle Meeting on Coding Theory and Applications ICMCTA 2017: Coding Theory and Applications, 207-216. The final authenticated version is available online at: <a href=http://dx.doi.org/10.1007/978-3-319-66278-7_17> http://dx.doi.org/10.1007/978-3-319-66278-7_17 </a>.en_US
dc.identifier.citationJohnsen, T., Verdure, H.. (2017) Relative generalized hamming weights and extended weight polynomials of almost affine codes. Lecture Notes in Computer Science. 10495 LNCS:207-216en_US
dc.identifier.cristinIDFRIDAID 1513079
dc.identifier.doi10.1007/978-3-319-66278-7_17
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttps://hdl.handle.net/10037/12402
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.journalLecture Notes in Computer Science
dc.rights.accessRightsopenAccessen_US
dc.subjectVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420en_US
dc.subjectVDP::Mathematics and natural science: 400::Information and communication science: 420en_US
dc.titleRelative generalized hamming weights and extended weight polynomials of almost affine codesen_US
dc.typeJournal articleen_US
dc.typeTidsskriftartikkelen_US
dc.typePeer revieweden_US


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel