Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes

Abstract

Folded Reed-Solomon (RS) codes are an explicit family of codes that achieve the optimal tradeoff between rate and list error-correction capability: specifically, for any , Guruswami and Rudra presented an time algorithm to list decode appropriate folded RS codes of rate from a fraction of errors. The algorithm is based on multivariate polynomial interpolation and root-finding over extension fields. It was noted by Vadhan that interpolating a linear polynomial suffices for a statement of the above form. Here, we give a simple linear-algebra-based analysis of this variant that eliminates the need for the computationally expensive root-finding step over extension fields (and indeed any mention of extension fields). The entire list-decoding algorithm is linear-algebraic, solving one linear system for the interpolation step, and another linear system to find a small subspace of candidate solutions. Except for the step of pruning this subspace, the algorithm can be implemented to run in quadratic time. We also consider a closely related family of codes, called (order ) derivative codes and defined over fields of large characteristic, which consist of the evaluations of as well as its first formal derivatives at distinct field elements. We show how our linear-algebraic methods for folded RS codes can be used to show that derivative codes can also achieve the above optimal tradeoff. The theoretical drawback of our analysis for folded RS codes and derivative codes is that both the decoding complexity and proven worst-case list-size bound are . By combining the above idea with a pseudorandom subset of all polynomials as messages, we get a Monte Carlo construction achieving a list-size bound of which is quite close to the existential bound (however, the decoding complexity remains ). Our work highlights that constructing an explicit subspace-evasive subset that has small intersection with low-dimensional subspaces-an interesting problem in pseudorandomness in its own right-could lead to explicit codes with better list-decoding guarantees.

Explicit Subspace Designs

“…For explicit (deterministic polynomial time) constructions, subcodes based on subspace-evasive sets of folded Reed-Solomon or multiplicity codes [8,3], achieve constant list size of (1/ε) O(1/ε) and an alphabet size n O(1/ε 2 ) . 1 3.…”

Untitled

“…Theorem A was independently discovered by Guruswami and Wang [13]. The method of proof and the algorithm there are simpler than ours, but our approach yields a slightly better list-decoding radius for each fixed multiplicity code.…”

“…Many new families of codes meeting list-decoding capacity have been discovered [13,4,16,14,15,9], and today we know constructions of such codes which also achieve near-optimal alphabet size, list size and list-decoding time. See [9] for a detailed description of the state of the art in this area.…”

Average-radius list-recoverability of random linear codes

“…This setting is interesting because (to the best of our knowledge) the are no known explicit constructions of high-rate, linear, list-recoverable codes. There are many constructions of high-rate list-recoverable codes (e.g., [GR08,GW13,Kop15,GX13] to name a few). However, none of these constructions are linear: they all rely on manipulating the code alphabet (folding, adding derivatives, and so on), which destroys linearity.…”