The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields
<|reference_start|>The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields: Garcia and Stichtenoth discovered two towers of function fields that meet the Drinfeld-Vl\u{a}du\c{t} 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.<|reference_end|>
@article{bras-amorós2006the,
    title={The Order Bound on the Minimum Distance of the One-Point Codes
  Associated to a Garcia-Stichtenoth Tower of Function Fields},
    author={Maria Bras-Amor'os, Michael E. O'Sullivan},
    journal={arXiv preprint arXiv:cs/0609161},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0609161},
    primaryClass={cs.IT cs.DM math.IT}
}