DeepAI
Log In Sign Up

Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors

04/20/2020
by   Emmanuel Abbe, et al.
0

This paper considers 'δ-almost Reed-Muller codes', i.e., linear codes spanned by evaluations of all but a δ fraction of monomials of degree at most r. It is shown that for any δ > 0 and any ε>0, there exists a family of δ-almost Reed-Muller codes of constant rate that correct 1/2-ε fraction of random errors with high probability. For exact Reed-Muller codes, the analogous result is not known and represents a weaker version of the longstanding conjecture that Reed-Muller codes achieve capacity for random errors (Abbe-Shpilka-Wigderson STOC '15). Our approach is based on the recent polarization result for Reed-Muller codes, combined with a combinatorial approach to establishing inequalities between the Reed-Muller code entropies.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/29/2018

On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures

This work proves new results on the ability of binary Reed-Muller codes ...
08/17/2020

On codes decoding a constant fraction of errors on the BSC

Using techniques and results from Kudekar et al. we strengthen the bound...
01/16/2022

Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions

In this work, we study linear error-correcting codes against adversarial...
10/31/2017

On the List-Decodability of Random Linear Rank-Metric Codes

The list-decodability of random linear rank-metric codes is shown to mat...
09/16/2019

On Decoding Cohen-Haeupler-Schulman Tree Codes

Tree codes, introduced by Schulman, are combinatorial structures essenti...
07/07/2022

Identification based on random coding

Ahlswede and Dueck showed possibility to identify with high probability ...
07/12/2021

Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions

In this work, we study linear error-correcting codes against adversarial...