Algebraic decoding using special divisors
Iwan Duursma · IEEE Transactions on Information Theory · 1993
The basic algorithm for decoding of algebraic-geometric codes corrects up to (d/sub c/-1)2-g/2 errors, where d/sub 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 (d/sub c/-1)/2-s errors, s is called the Clifford defect of a curve. For curves with g>or=1, this defect satisfies 0>