Reed-Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity
From MaRDI portal
Publication:6576012
DOI10.1109/TIT.2023.3286452zbMATH Open1547.94238MaRDI QIDQ6576012FDOQ6576012
Galen Reeves, Henry David Pfister
Publication date: 22 July 2024
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
binary memoryless symmetric (BMS) channelsbitwise maximum-a-posteriori (bit-MAP) decodingperformance of Reed-Muller (RM) codes
Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)
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)
