Binary Reed-Muller codes achieve the symmetric capacity on indecomposable finite-state channels.
Capacity- approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels
Binary Reed-Muller codes achieve the symmetric capacity on indecomposable finite-state channels.