Algebraic geometry code decoding based on Chinese remainder theorem

In contrast to the conventional decoding of an algebraic geometry code that involves syndrome computing, finding error location and error magnitude computing, this paper proposes the new technique for a decoding system that makes use of the Chinese remainder theorem reconstruction. The modified version of the extended Euclid algorithm is then applied to solve the resulting key equation. The information polynomial can then be obtained directly without the knowledge of error location a priori. Our decoder can correct errors up to [(d-1)/2], where d denotes the minimum distance of the full length code