Linear codes on posets with extension property

dc.creatorBarg, A
dc.creatorFelix, LV
dc.creatorFirer, M
dc.creatorSpreafico, MVP
dc.date2014
dc.dateFEB 28
dc.date2014-08-01T18:34:48Z
dc.date2015-11-26T18:04:07Z
dc.date2014-08-01T18:34:48Z
dc.date2015-11-26T18:04:07Z
dc.date.accessioned2018-03-29T00:46:10Z
dc.date.available2018-03-29T00:46:10Z
dc.identifierDiscrete Mathematics. Elsevier Science Bv, v. 317, n. 1, n. 13, 2014.
dc.identifier0012-365X
dc.identifier1872-681X
dc.identifierWOS:000331159100001
dc.identifier10.1016/j.disc.2013.11.001
dc.identifierhttp://www.repositorio.unicamp.br/jspui/handle/REPOSIP/81076
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/81076
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1292752
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionWe investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of translation association schemes that originate from the groups of linear isometries of the space. We address questions of duality and invariants of codes, establishing a connection between the dual association scheme and the scheme defined on the dual poset (they are isomorphic if and only if the poset is self-dual). We further discuss invariants that play the role of weight enumerators of codes in the poset case. In the case of regular rooted trees such invariants are linked to the classical problem of tree isomorphism. We also study the question of whether these invariants are preserved under standard operations on posets such as the ordinal sum and the like. (C) 2013 Published by Elsevier B.V.
dc.description317
dc.description1
dc.description13
dc.descriptionNSA [H98230-12-1-0260]
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionNSF [CCF0916919, CCF1217245, CCF1217894, DMS1101697]
dc.descriptionFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.descriptionNSA [H98230-12-1-0260]
dc.descriptionFAPESP [2007/56052-8, 2102/20181-7]
dc.descriptionNSF [CCF0916919, CCF1217245, CCF1217894, DMS1101697]
dc.languageen
dc.publisherElsevier Science Bv
dc.publisherAmsterdam
dc.publisherHolanda
dc.relationDiscrete Mathematics
dc.relationDiscret. Math.
dc.rightsfechado
dc.rightshttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dc.sourceWeb of Science
dc.subjectPoset codes
dc.subjectAssociation schemes
dc.subjectMacWilliams relations
dc.subjectAssociation Schemes
dc.subjectOrthogonal Arrays
dc.subjectClassification
dc.subjectIdentity
dc.subjectSpaces
dc.titleLinear codes on posets with extension property
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución