Root lifting techniques and applications to list decoding

Authors:
Muhammad F.I. Chowdhury;Romain Lebreton
Affiliations:
The University of Western Ontario, London, Canada;École polytechnique, France
Venue:
ACM Communications in Computer Algebra
Year:
2011

Citing 7
Cited 0

Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Fast Algorithms for Manipulating Formal Power Series

Journal of the ACM (JACM)
Relax, but don't be too lazy

Journal of Symbolic Computation
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes

IEEE Transactions on Information Theory
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivatived by Guruswami and Rudra's construction of folded Reed-Solomon codes, we give algorithms to solve functional equations of the form Q(x, f(x), f(x)) = 0, where Q is a trivariate polynomial. We compare two approaches, one based on Newton's iteration and the second using relaxed series techniques.