Abstract
Generalized geometric Goppa codes are vector spaces of n-tuples with entries from different extension fields of a ground field. They are derived from evaluating functions similar to conventional geometric Goppa codes, but allowing evaluation in places of arbitrary degree. A decoding scheme for these codes based on Sudan's improved algorithm is presented and its error-correcting capacity is analyzed. For the implementation of the algorithm it is necessary that the so-called increasing zero bases of certain spaces of functions are available. A method to obtain such bases is developed.
Original language | English |
---|---|
Journal | Finite Fields and Their Applications |
Volume | 9 |
Issue number | 3 |
Pages (from-to) | 267-285 |
ISSN | 1071-5797 |
DOIs | |
Publication status | Published - 2003 |