Efficiently Decoding Reed–Muller Codes From Random Errors

DOI10.1109/TIT.2017.2671410MaRDI QIDQ5280877zbMATH OpenOpenAlexFDO

Authors Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2017.2671410

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(8)

• Reinforcement learning for optimal error correction of toric codes
• Decoding of Reed-Muller codes with a large number of errors
• Recursive error correction for general Reed--Muller codes
• Extractors from Reed-Muller codes
• Reed–Muller Codes for Random Erasures and Errors
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors
• Reed-Muller Codes

This page was built for publication: Efficiently Decoding Reed–Muller Codes From Random Errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280877)