On the gonality of curves, abundant codes and decoding (Q4027645)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 125906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the gonality of curves, abundant codes and decoding |
scientific article; zbMATH DE number 125906 |
Statements
21 February 1993
0 references
upper bounds
0 references
divisors on algebraic curves over finite fields
0 references
minimum distance of geometric Goppa codes
0 references
gonality
0 references
modular curves
0 references
Gilbert- Varshamov bound
0 references
decoding algorithms
0 references
0.9033915
0 references
0.90254605
0 references
0 references
0 references
0.8953817
0 references
0 references
0 references
On the gonality of curves, abundant codes and decoding (English)
0 references
[For the entire collection see Zbl 0745.00062.] In this paper particular divisors on algebraic curves over finite fields are used to get improvements on the bounds on the minimum distance of geometric Goppa codes. The improvement is measured by the gonality of the curve used. Using modular curves one gets in this way asymptotically good codes which are better than the codes found by Tsfasman, Vlăduţ and Zink, but worse than the Gilbert-Varshamov bound. Upper bounds on linear codes are used to give upper bounds for the gonality of curves over finite fields. Finally this is used to get improved decoding algorithms.
0 references