Dense representation of affine coordinate rings of curves with one point at infinity
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A Fast Decoding Method of AG Codes from Miura-Kamiya Curves Cab up to Half the Feng-Rao Bound
Finite Fields and Their Applications
On the Structure of Order Domains
Finite Fields and Their Applications
Decoding Algebraic Geometry Codes by a Key Equation
Finite Fields and Their Applications
Bounds on collaborative decoding of interleaved Hermitian codes and virtual extension
Designs, Codes and Cryptography
| Hi-index | 754.84 |
Decoding geometric Goppa codes can be reduced to solving the key congruence of a received word in an affine ring. If the codelength is smaller than the number of rational points on the curve, then this method can correct up to 1.2 (d*-L)/2-s errors, where d* is the designed minimum distance of the code and s is the Clifford defect. The affine ring with respect to a place P is the set of all rational functions which have no poles except at P, and it is somehow similar to a polynomial ring. For a special kind of geometric Goppa code, namely CΩ(D,mP), the decoding algorithm is reduced to solving the key equation in the affine ring, which can be carried out by the subresultant sequence in the affine ring with complexity O(n3), where n is the length of codewords