Algebraic geometry code decoding based on Chinese Remainder Theorem

Maidee, Pongstorn; Choomchuay, Somsak

Algebraic geometry code decoding based on Chinese Remainder Theorem

Author(s)

Maidee, Pongstorn

Choomchuay, Somsak

Date Issued

December 1, 1998

Type

Article

Abstract

In contrast to the conventional decoding of an Algebraic Geometry code that involves syndrome computing, finding error location and error magnitude computing, this paper purposes the new technique of the 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 resulted key equation. The information polynomial can then be obtained directly without the knowledge of error location priori. Our decoder can correct errors up to [(d-1)2], where d denotes the minimum distance of the full length code.

Citation

IEEE Asia Pacific Conference on Circuits and Systems Proceedings, 475-478, 1998