On Fast Interpolation Method for Guruswami-Sudan List Decoding of One-Point Algebraic-Geometry Codes
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
On Representations of Algebraic-Geometric Codes for List Decoding
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
List decoding of Hermitian codes using Gröbner bases
Journal of Symbolic Computation
Root lifting techniques and applications to list decoding
ACM Communications in Computer Algebra
Sudan-decoding generalized geometric Goppa codes
Finite Fields and Their Applications
Hi-index | 754.84 |
This article presents an algorithmic improvement to Sudan's (see J. Complexity, vol.13, p.180-93, 1997) list-decoding algorithm for Reed-Solomon codes and its generalization to algebraic-geometric codes from Shokrollahi and Wasserman (see ibid., vol.45, p.432-37, 1999). Instead of completely factoring the interpolation polynomial over the function field of the curve, we compute sufficiently many coefficients of a Hensel development to reconstruct the functions that correspond to codewords. We prove that these Hensel developments can be found efficiently using Newton's method. We also describe the algorithm in the special case of Reed-Solomon codes