Topic
Guruswami–Sudan list decoding algorithm
About: Guruswami–Sudan list decoding algorithm is a research topic. Over the lifetime, 2 publications have been published within this topic receiving 13 citations.
Papers
1 Jan 2009
TL;DR: This work revisits the generalisation of the Guruswami–Sudan list decoding algorithm to Reed–Muller codes and gives a stronger form of the well-known Schwartz–Zippel Lemma, which gets an improved decoding radius.
Abstract: We revisit the generalisation of the Guruswami–Sudan list decoding algorithm to Reed–Muller codes. Although the generalisation is straightforward, the analysis is more difficult than in the Reed–Solomon case. A previous analysis has been done by Pellikaan and Wu (List decoding of q-ary Reed–Muller codes, Tech. report, from the authors, 2004a; IEEE Trans. on Inf. Th. 50(4): 679–682, 2004b), relying on the theory of Grobner bases We give a stronger form of the well-known Schwartz–Zippel Lemma (Schwartz in J. Assoc. Comput. Mach. 27(4): 701–717, 1980; Zippel in Proc. of EUROSAM 1979, LNCS, vol. 72, Springer, Berlin, pp. 216–226, 1979), taking multiplicities into account. Using this Lemma, we get an improved decoding radius.
8 citations
27 Jun 2004
TL;DR: A simple modification to the Guruswami-Sudan list decoding algorithm is presented to exceed the decoding radius of the original algorithm and is applicable to generalized Reed-Solomon codes over Galois rings and their subring subcodes.
Abstract: 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
5 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2009 | 1 |
| 2004 | 1 |