The paper derives recursive two-look and three-look bounds showing Reed-Muller codes achieve capacity on BMS channels and a faster BSC decay rate via level-k inequalities.
A proof that Reed-Muller codes ach ieve Shannon capacity on symmetric channels,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Capacity on BMS Channels via Code Symmetry and Nesting
The paper derives recursive two-look and three-look bounds showing Reed-Muller codes achieve capacity on BMS channels and a faster BSC decay rate via level-k inequalities.