Using Reed–Muller {\hbox{RM}}\,(1, m) Codes Over Channels With Synchronization and Substitution Errors

DOI10.1109/TIT.2007.892776MaRDI QIDQ3548906zbMATH OpenOpenAlexFDO

Authors Lara Dolecek, Venkat Anantharam

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Source coding (94A29) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Recommendations

• On the performance of Reed-Muller codes with respect to random errors and erasures
• Reed-Muller codes for random erasures and errors
• Reed–Muller Codes for Random Erasures and Errors
• Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel
• Reed-Muller codes achieve capacity on erasure channels
• Reed–Muller Codes Achieve Capacity on Erasure Channels
• Reed‐muller codes: an ideal theory approach
• Efficiently decoding Reed-Muller codes from random errors
• Efficiently Decoding Reed–Muller Codes From Random Errors
• Recursive error correction for general Reed--Muller codes

Cited in

(1)

• New dimension-independent upper bounds on linear insdel codes

This page was built for publication: Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors

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