Abstract
This correspondence gives an errata (that is erasure-and error-) decoding algorithm of one-point algebraic-geometry codes up to the Feng-Rao designed minimum distance using Sakata's multidimensional generalization of the Berlekamp-Massey algorithm and the voting procedure of Feng and Rao.
Original language | English |
---|---|
Journal | I E E E Transactions on Information Theory |
Volume | 44 |
Issue number | 4 |
Pages (from-to) | 1558-1564 |
ISSN | 0018-9448 |
DOIs | |
Publication status | Published - 1998 |
Event | 1997 IEEE International Symposium on Information Theory - Ulm, Germany Duration: 29 Jun 1997 → 4 Jul 1997 |
Conference
Conference | 1997 IEEE International Symposium on Information Theory |
---|---|
Country/Territory | Germany |
City | Ulm |
Period | 29/06/1997 → 04/07/1997 |
Keywords
- algebraic-geometry codes
- erasure and error decoding
- Sakata's algorithm