An extension of the order bound for AG codes

Details An extension of the order bound for AG codes An extension of the order bound for AG codes

2009-01-19

arxiv.org/abs/0901.2864v1

Mathematics

Number Theory

11 pages

Scientific paper

10.1007/978-3-642-02181-7

The most successful method to obtain lower bounds for the minimum distance of an algebraic geometric code is the order bound, which generalizes the Feng-Rao bound. We provide a significant extension of the bound that improves the order bounds by Beelen and by Duursma and Park. We include an exhaustive numerical comparison of the different bounds for 10168 two-point codes on the Suzuki curve of genus g=124 over the field of 32 elements. Keywords: algebraic geometric code, order bound, Suzuki curve.

Affiliated with

Also associated with

No associations

Rating

An extension of the order bound for AG codes 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 An extension of the order bound for AG codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An extension of the order bound for AG codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-566802