Decoding algebraic-geometric codes up to the designed minimumdistance |
| |
| Authors: | Feng G.-L. Rao T.R.N. |
| |
| Affiliation: | Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA; |
| |
| Abstract: | A simple decoding procedure for algebraic-geometric codes C Ω(D,G) is presented. This decoding procedure is a generalization of Peterson's decoding procedure for the BCH codes. It can be used to correct any [(d*-1)/2] or fewer errors with complexity O(n3), where d * is the designed minimum distance of the algebraic-geometric code and n is the codelength |
| |
| Keywords: | |
|
|
