Forney concatenation with BCH outer codes converts bit-error probability o(1/log log n) into vanishing block-error probability at capacity-achieving rates on BMS channels.
From Bit to Block: Decoding on Erasure Channels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We provide a general framework for bounding the block error threshold of a linear code $C\subseteq \mathbb{F}_2^N$ over the erasure channel in terms of its bit error threshold. Our approach relies on understanding the minimum support weight of any $r$-dimensional subcode of $C$, for all small values of $r$. As a proof of concept, we use our machinery to obtain a new proof of the celebrated result that Reed-Muller codes achieve capacity on the erasure channel with respect to block error probability.
fields
cs.IT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
From Bit to Block: Capacity Achievement via Code Concatenation
Forney concatenation with BCH outer codes converts bit-error probability o(1/log log n) into vanishing block-error probability at capacity-achieving rates on BMS channels.