A Fast Generalized Minimum Distance Decoder for Reed-Solomon Codes Based on the Extended Euclidean Algorithm
Sabine Kampf, Martin Bossert · 2016
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).