 |
 |
|
|
| HAL: inria-00564022, version 1 |
| DOI: 10.1007/978-3-540-93806-4_27 |
| See detailed view |  BibTeX,EndNote,... |
 |
| Gröbner Bases, Coding, and Cryptography, Massimiliano Sala and Teo Mora and Ludovic Perret and Shojiro Sakata and Carlo Traverso (Ed.) (2009) 395-398 |
|
|
|
|
| A note on the generalisation of the Guruswami-Sudan list decoding algorithm to Reed-Muller codes |
|
|
| Daniel Augot 1Michael Stepanov 2 |
|
|
| (2009) |
|
|
|
| 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, relying on the theory of Groebner bases [2, 3]. We give a stronger form of the well-known Schwartz-Zippel Lemma [5, 4], taking multiplicities into account. Using this Lemma, we get an improved decoding radius. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | TANC (INRIA Saclay - Ile de France) |
|
|
|
INRIA – Polytechnique - X – CNRS : UMR7161 |
|
|
| 2: | Information Theory, Antinoise Coding and Establishment of Information Systems and Technologies for Transmission and Protection of Information |
|
|
|
Saint-Petersburg State University of Aerospace Instrumentation |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Information Theory and Coding Mathematics/Information Theory |
| inria-00564022, version 1 | |
| http://hal.inria.fr/inria-00564022 | |
| oai:hal.inria.fr:inria-00564022 | |
| From: Daniel Augot | |
| Submitted on: Monday, 7 February 2011 18:11:26 | |
| Updated on: Monday, 7 February 2011 18:11:26 | |
