The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields

Simple item page
dc.creatorBras-Amorós, Maria
dc.creatorO'Sullivan, Michael E.
dc.date2006-09-29
dc.date2006-11-15
dc.date.accessioned2026-07-07T08:18:02Z
dc.date.available2026-07-07T08:18:02Z
dc.descriptionGarcia and Stichtenoth discovered two towers of function fields that meet the Drinfeld-Vlăduţ bound on the ratio of the number of points to the genus. For one of these towers, Garcia, Pellikaan and Torres derived a recursive description of the Weierstrass semigroups associated to a tower of points on the associated curves. In this article, a non-recursive description of the semigroups is given and from this the enumeration of each of the semigroups is derived as well as its inverse. This enables us to find an explicit formula for the order (Feng-Rao) bound on the minimum distance of the associated one-point codes.
dc.descriptionA new section is added in which the order bound is derived
dc.identifierhttps://arxiv.org/abs/cs/0609161
dc.identifierhttp://arxiv.org/abs/cs/0609161
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134296
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectE.4
dc.titleThe Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields
dc.typetext

Files

Collections

arXiv