Improved decoding of Folded Reed-Solomon and Multiplicity Codes

05/03/2018
by   Swastik Kopparty, et al.
0

In this work, we show new and improved error-correcting properties of folded Reed-Solomon codes and multiplicity codes. Both of these families of codes are based on polynomials over finite fields, and both have been the sources of recent advances in coding theory. Folded Reed-Solomon codes were the first explicit constructions of codes known to achieve list-decoding capacity; multivariate multiplicity codes were the first constructions of high-rate locally correctable codes; and univariate multiplicity codes are also known to achieve list-decoding capacity. However, previous analyses of the error-correction properties of these codes did not yield optimal results. In particular, in the list-decoding setting, the guarantees on the list-sizes were polynomial in the block length, rather than constant; and for multivariate multiplicity codes, local list-decoding algorithms could not go beyond the Johnson bound. In this paper, we show that Folded Reed-Solomon codes and multiplicity codes are in fact better than previously known in the context of list-decoding and local list-decoding. More precisely, we first show that Folded RS codes achieve list-decoding capacity with constant list sizes, independent of the block length; and that high-rate univariate multiplicity codes can also be list-recovered with constant list sizes. Using our result on univariate multiplicity codes, we show that multivariate multiplicity codes are high-rate, locally list-recoverable codes. Finally, we show how to combine the above results with standard tools to obtain capacity achieving locally list decodable codes with query complexity significantly lower than was known before.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2023

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets

This paper shows that, with high probability, randomly punctured Reed-So...
research
12/02/2020

Decoding Multivariate Multiplicity Codes on Product Sets

The multiplicity Schwartz-Zippel lemma bounds the total multiplicity of ...
research
10/22/2020

Locally Decodable/Correctable Codes for Insertions and Deletions

Recent efforts in coding theory have focused on building codes for inser...
research
03/11/2020

Beyond the Guruswami-Sudan (and Parvaresh-Vardy) Radii: Folded Reed-Solomon, Multiplicity and Derivative Codes

The classical family of Reed-Solomon codes consist of evaluations of pol...
research
03/14/2021

Ideal-theoretic Explanation of Capacity-achieving Decoding

In this work, we present an abstract framework for some algebraic error-...
research
04/19/2023

Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields

Reed–Solomon codes are a classic family of error-correcting codes consis...
research
03/30/2023

Pseudorandom Linear Codes are List Decodable to Capacity

We introduce a novel family of expander-based error correcting codes. Th...

Please sign up or login with your details

Forgot password? Click here to reset