On the efficient decoding of Reed-Solomon codes based on GMD criterion
Kenji Araki, M. Takada, Masakatu Morii · 2003
An efficient algorithm for GMD (generalized minimum distance) decoding is presented. It requires an algebraic errors-and-erasures decoding procedure to execute only one time. The Welch-Berlekamp iterative method is efficiently used to reduce the number of algebraic decoding procedures. A method for hardware implementation of this GMD decoding is shown.>