An extension of the order bound for AG codes
Number Theory
2010-04-13 v1 Information Theory
Algebraic Geometry
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.0901.2864,
title = {An extension of the order bound for AG codes},
author = {Iwan Duursma and Radoslav Kirov},
journal= {arXiv preprint arXiv:0901.2864},
year = {2010}
}
Comments
11 pages