Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels


Recently, sequences of error-correcting codes with doubly-transitive permutation groups were shown to achieve capacity on erasure channels under symbol-wise maximum a posteriori (MAP) decoding. From this, it follows that Reed-Muller and primitive narrow-sense BCH codes achieve capacity in the same setting. In this article, we extend this result to a large… (More)
DOI: 10.1109/ITW.2016.7606832


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.