Abstract
In general, the basic algorithm for decoding of algebraic-geometric codes does not correct up to the designed minimum distance. Pellikaan formulated a nonconstructive procedure to overcome this. More recently, Feng and Rao suggested a constructive procedure for a particular class of codes. Their procedure for the general case is formulated.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1067-1070 |
| Number of pages | 4 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 39 |
| Issue number | 3 |
| DOIs | |
| State | Published - 1993 |
| Externally published | Yes |
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences