Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel

DOI10.1109/TIT.2006.883557MaRDI QIDQ3547990zbMATH OpenOpenAlexFDO

Authors M. V. Burnashev, I. I. Dumer

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.2006.883557

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Recommendations

• Recursive error correction for general Reed--Muller codes
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• scientific article; zbMATH DE number 2154515
• Soft-decision decoding of Reed-Muller codes: recursive lists
• Decoding of Reed-Muller codes with a large number of errors

Cited in

(7)

• On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
• Recursive error correction for general Reed--Muller codes
• Exact Random Coding Error Exponents of Optimal Bin Index Decoding
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• Exponential Error Bounds for Algebraic Soft-Decision Decoding of Reed–Solomon Codes
• Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors
• scientific article; zbMATH DE number 2154515 (Why is no real title available?)

This page was built for publication: Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel

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