Suppose C is an irreducible algebraic curve of genus g, C*(D,G) is an algebraic geometric code with designed minimum distance d* = deg(G)-2g + 2. In this paper, a decoding algorithm based on Fundamental Iterative Algo...Suppose C is an irreducible algebraic curve of genus g, C*(D,G) is an algebraic geometric code with designed minimum distance d* = deg(G)-2g + 2. In this paper, a decoding algorithm based on Fundamental Iterative Algorithm(FIA) is presented, also its reasonableness is proved. In fact, our decoding algorithm is a modification of the algorithm proposed by G. L. Fend and T. R. N. Rao(1993) and can correct any received words with errors not more than (d*-1)/2, whereas the complexity is only about one half as much as Feng and Rao’s. The procedure can be implemented easily by hardware or software.展开更多
文摘Suppose C is an irreducible algebraic curve of genus g, C*(D,G) is an algebraic geometric code with designed minimum distance d* = deg(G)-2g + 2. In this paper, a decoding algorithm based on Fundamental Iterative Algorithm(FIA) is presented, also its reasonableness is proved. In fact, our decoding algorithm is a modification of the algorithm proposed by G. L. Fend and T. R. N. Rao(1993) and can correct any received words with errors not more than (d*-1)/2, whereas the complexity is only about one half as much as Feng and Rao’s. The procedure can be implemented easily by hardware or software.
