Abstract
The basic algorithm for decoding of algebraic-geometric codes corrects up to (dc-1)2-g/2 errors, where d c denotes the designed minimum distance of a code and g denotes the genus of a curve. The modified algorithm improves on this, but applies to a restricted class of codes. An extended modified algorithm that applies to all codes is formulated. It will correct up to (dc-1)/2-s errors, s is called the Clifford defect of a curve. For curves with g⩾1, this defect satisfies 0⩽s⩽(g-1)/2. The success of the algorithm depends highly on the curve that is used and the result is in the first place a theoretical result. To support the practical importance, two special cases are considered. All codes from hyperelliptic curves can be decoded up to the designed minimum distance. For plane curves that contain at least one rational point, it is shown that s⩽(g+1)/4.
| Original language | English |
|---|---|
| Pages (from-to) | 694-698 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 39 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1993 |
Fingerprint Dive into the research topics of 'Algebraic decoding using special divisors'. Together they form a unique fingerprint.
Cite this
Duursma, I. M. (1993). Algebraic decoding using special divisors. IEEE Transactions on Information Theory, 39(2), 694-698. https://doi.org/10.1109/18.212305