Efficiently decoding Reed-Muller codes from random errors

DOI10.1145/2897518.2897526zbMath1377.94076arXiv1503.09092OpenAlexW2245001294MaRDI QIDQ5361832

Ramprasad Saptharishi, Ben lee Volk, Amir Shpilka

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.09092

zbMATH Keywords

Reed-Muller codeserror correcting codesrandom errors

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

This page was built for publication: Efficiently decoding Reed-Muller codes from random errors