Improved list decoding of generalized reed-solomon and alternant codes over rings
M.A. Armand · 2004
We present a simple modification to the Guruswami-Sudan list decoding algorithm to exceed the decoding radius of the original algorithm. It exploits the presence of nontrivial zero divisors in the code alphabet and is applicable, but not limited to, generalized Reed-Solomon codes over Galois rings and their subring subcodes