Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes

We show that the known list-decoding algorithms for univariate multiplicity and folded Reed-Solomon (FRS) codes can be made to run in nearly-linear time. This yields, to our knowledge, the first known family of codes that can be decoded in nearly linear time, even as they approach the list decoding capacity. Univariate multiplicity codes and FRS codes are natural variants of Reed-Solomon codes that were discovered and studied for their applications to list-decoding. It is known that for every ϵ >0, and rate R ∈ (0,1), there exist explicit families of these codes that have rate R and can be list-decoded from a (1-R-ϵ) fraction of errors with constant list size in polynomial time (Guruswami Wang (IEEE Trans. Inform. Theory, 2013) and Kopparty, Ron-Zewi, Saraf Wootters (SIAM J. Comput. 2023)). In this work, we present randomized algorithms that perform the above tasks in nearly linear time. Our algorithms have two main components. The first builds upon the lattice-based approach of Alekhnovich (IEEE Trans. Inf. Theory 2005), who designed a nearly linear time list-decoding algorithm for Reed-Solomon codes approaching the Johnson radius. As part of the second component, we design nearly-linear time algorithms for two natural algebraic problems. The first algorithm solves linear differential equations of the form Q(x, f(x), df/dx, …,d^m f/dx^m) ≡ 0 where Q has the form Q(x,y_0,…,y_m) = Q̃(x) + ∑_i = 0^m Q_i(x)· y_i. The second solves functional equations of the form Q(x, f(x), f(γ x), …,f(γ^m x)) ≡ 0 where γ is a high-order field element. These algorithms can be viewed as generalizations of classical algorithms of Sieveking (Computing 1972) and Kung (Numer. Math. 1974) for computing the modular inverse of a power series, and might be of independent interest.