Computer Science – Information Theory
Scientific paper
2006-09-29
Computer Science
Information Theory
A new section is added in which the order bound is derived
Scientific paper
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.
Bras-Amorós Maria
O'Sullivan Michael E.
No associations
LandOfFree
The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Order Bound on the Minimum Distance of the One-Point Codes Associated to a Garcia-Stichtenoth Tower of Function Fields will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-184252