Abstract:
A decoding algorithm for the efficient Generalized Minimum Distance (GMD)
decoding of algebraic geometric codes is given. The required complexity
of finding all relevant error-erasure-locating functions in GMD decoding
is shown to be in the same order as that of hard decoding.