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

Emmanuel Abbe, Jan Hazla, Ido Nachum (2020)
a service of Schloss Dagstuhl - Leibniz Center for Informatics