Improved decoding of algebraic-geometric codes with respect to the Lee metric

Algebraic-geometric codes are a class of linear codes derived from algebraic curves over finite fields. The well-known Reed-Solomon codes and BCH codes can be viewed as special instances of this class of codes. Algebraic-geometric codes provide flexibility in practical applications where linear codes are used to guarantee the performance of communications systems. Decoding algorithms of BCH codes, Reed-Solomon codes and algebraic-geometric codes with respect to the Lee metric have been studied in the literature. These decoding algorithms are built on the interpolation-based list-decoding algorithm by Sudan and Guruswami. In this paper, we present an improved decoding algorithm of algebraic-geometric codes with respect to the Lee metric. An upper bound is given for the Lee-error correcting performance of our decoding algorithm