Pseudorandom Linear Codes are List Decodable to Capacity

03/30/2023
āˆ™
by   Aaron L Putterman, et al.
āˆ™
0
āˆ™

We introduce a novel family of expander-based error correcting codes. These codes can be sampled with randomness linear in the block-length, and achieve list-decoding capacity (among other local properties). Our expander-based codes can be made starting from any family of sufficiently low-bias codes, and as a consequence, we give the first construction of a family of algebraic codes that can be sampled with linear randomness and achieve list-decoding capacity. We achieve this by introducing the notion of a pseudorandom puncturing of a code, where we select n indices of a base code CāŠ‚š”½_q^m via an expander random walk on a graph on [m]. Concretely, whereas a random linear code (i.e. a truly random puncturing of the Hadamard code) requires O(n^2) random bits to sample, we sample a pseudorandom linear code with O(n) random bits. We show that pseudorandom puncturings satisfy several desirable properties exhibited by truly random puncturings. In particular, we extend a result of (Guruswami Mosheiff FOCS 2022) and show that a pseudorandom puncturing of a small-bias code satisfies the same local properties as a random linear code with high probability. As a further application of our techniques, we also show that pseudorandom puncturings of Reed Solomon codes are list-recoverable beyond the Johnson bound, extending a result of (Lund Potukuchi RANDOM 2020). We do this by instead analyzing properties of codes with large distance, and show that pseudorandom puncturings still work well in this regime.

READ FULL TEXT
research
āˆ™ 09/13/2019

LDPC Codes Achieve List Decoding Capacity

We show that Gallager's ensemble of Low-Density Parity Check (LDPC) code...
research
āˆ™ 09/24/2021

Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity

We prove the existence of Reed-Solomon codes of any desired rate R āˆˆ (0,...
research
āˆ™ 05/03/2018

Improved decoding of Folded Reed-Solomon and Multiplicity Codes

In this work, we show new and improved error-correcting properties of fo...
research
āˆ™ 07/07/2022

Identification based on random coding

Ahlswede and Dueck showed possibility to identify with high probability ...
research
āˆ™ 06/10/2022

On some properties of random and pseudorandom codes

We describe some pseudorandom properties of binary linear codes achievin...
research
āˆ™ 08/01/2018

List Decoding with Double Samplers

We develop the notion of "double samplers", first introduced by Dinur an...
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...

Please sign up or login with your details

Forgot password? Click here to reset