Duality for Several Families of Evaluation Codes

Simple item page
dc.creatorBras-Amorós, Maria
dc.creatorO'Sullivan, Michael E.
dc.date2006-09-29
dc.date2006-12-11
dc.date.accessioned2026-07-07T08:18:02Z
dc.date.available2026-07-07T08:18:02Z
dc.descriptionWe consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary subsets of monomials, and in identifying when the dual codes are also obtained by evaluating monomials. We then move to the context of order domain theory, in which the subsets of monomials can be chosen to optimize decoding performance using the Berlekamp-Massey-Sakata algorithm with majority voting. We show that for the codes under consideration these subsets are well-behaved and the dual codes are also defined by monomials.
dc.descriptionAdded references
dc.identifierhttps://arxiv.org/abs/cs/0609159
dc.identifierhttp://arxiv.org/abs/cs/0609159
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134294
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectE.4
dc.titleDuality for Several Families of Evaluation Codes
dc.typetext

Files

Collections

arXiv