1995, 17(5): 492-499.
Abstract:
Supposing C is an irreducible algebraic curve of genus g, C*(D, G) is an algebraic geometric code of designed minimum distance d* = degG- 2g+2. This paper, first, proves that the given algorithm is reasonable theoretically, then gives a decoding algorithm based on Fundamental Iterative Algorithm (FIA), which is a modification of the algorithm proposed by G. L. Feng, et al. (1993) and can correct any received code of (d* -1)/2 or less errors with complexity only one half of that of the algorithm proposed by G.L.Feng, et al. The procedure can be implemented easily by hardware or software.