This paper presents an algorithmic improvement to Sudan's list-decoding algorithm for Reed-Solomon codes and its generalization to algebraic-geometric codes from Shokrollahi and Wasserman. 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.
Publié le : 2000-11-01
Classification:
ACM: E.: Data/E.4: CODING AND INFORMATION THEORY,
[INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT],
[MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
@article{inria-00509339,
author = {Augot, Daniel and Pecquet, Lancelot},
title = {A Hensel Lifting to Replace Factorization in List-Decoding of Algebraic-Geometric and Reed-Solomon Codes},
journal = {HAL},
volume = {2000},
number = {0},
year = {2000},
language = {en},
url = {http://dml.mathdoc.fr/item/inria-00509339}
}
Augot, Daniel; Pecquet, Lancelot. A Hensel Lifting to Replace Factorization in List-Decoding of Algebraic-Geometric and Reed-Solomon Codes. HAL, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/inria-00509339/