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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Garcia 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.
A new section is added in which the order bound is derived

Keywords

Information Theory, Discrete Mathematics, E.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/134296

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0609161
 http://arxiv.org/abs/cs/0609161

Collections

arXiv