Decoding algebraic geometry codes by a key equation (Q1587770)
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 1538397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decoding algebraic geometry codes by a key equation |
scientific article; zbMATH DE number 1538397 |
Statements
Decoding algebraic geometry codes by a key equation (English)
0 references
5 August 2001
0 references
The paper deals with the decoding problem for general algebraic-geometric codes. Effective decoding can be done by solving key equations, generalizing ideas of Berlekamp-Mattey and Feng-Rao. A new decoding algorithm is proposed which improves both the decoding capacity and the complexity, with the only further assumption that there is an extra rational point on the curve which is not used in the construction of the algebraic-geometric codes. A central role is played by Duursma's majority coset scheme.
0 references
decoding
0 references
algebraic-geometric codes
0 references
Duursma's majority coset scheme
0 references
0 references
0.8872355818748474
0 references
0.864740252494812
0 references
0.8613433241844177
0 references
