Unique Decoding of Plane AG Codes via Interpolation
Preprint
Abstract
We present a unique decoding algorithm of algebraic geometry codes on plane curves, Hermitian codes in particular, from an interpolation point of view. The algorithm successfully corrects errors of weight up to half of the order bound on the minimum distance of the AG code. The decoding algorithm is the first to combine some features of the interpolation based list decoding with the performance of the syndrome decoding with majority voting scheme. The regular structure of the algorithm allows a straightforward parallel implementation.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Algebraic Function Fields and Codes2009
- On Semigroups Generated by Two Consecutive Integers and Improved Hermitian CodesIEEE Transactions on Information Theory, 2007
- Introduction to Plane Algebraic Curves2007
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codesIEEE Transactions on Information Theory, 1998
- A Fast Decoding Method of AG Codes from Miura-Kamiya Curves Cab up to Half the Feng-Rao BoundFinite Fields and Their Applications, 1995
- Majority coset decodingIEEE Transactions on Information Theory, 1993