Preprint article
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
In
Lecture Notes in Computer Science
—
2009, pp. 11
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.
| Language: | English |
|---|---|
| Publisher: | Springer |
| Year: | 2009 |
| Pages: | 11 |
| Series: | Lecture Notes in Computer Science |
| ISBN: | 3642021808 , 3642021816 , 9783642021800 and 9783642021817 |
| ISSN: | 16113349 and 03029743 |
| Types: | Preprint article |
| DOI: | 10.1007/978-3-642-02181-7 |
