Reed-Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity

DOI10.1109/TIT.2023.3286452MaRDI QIDQ6576012zbMATH OpenFDO

Authors Galen Reeves, Henry David Pfister

Publication date 22 July 2024

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

Full work available at URL https://doi.org/10.1109/TIT.2023.3286452

zbMATH Keywords

binary memoryless symmetric (BMS) channelsbitwise maximum-a-posteriori (bit-MAP) decodingperformance of Reed-Muller (RM) codes

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(2)

• Coxeter codes: extending the Reed-Muller family
• A criterion for decoding on the binary symmetric channel

This page was built for publication: Reed-Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity

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