Root lifting techniques and applications to list decoding
Muhammad F. I. Chowdhury, Romain Lebreton · ACM communications in computer algebra · 2011
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.