Reed-Muller codes achieve capacity on erasure channels

DOI10.1145/2897518.2897584zbMath1377.94073OpenAlexW2963024133MaRDI QIDQ5361869

Shrinivas Kudekar, Henry David Pfister, Santhosh Kumar, Eren Şaşoğlu, Marco Mondelli, Ruediger Urbanke

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2897518.2897584

zbMATH Keywords

BCH codesReed-Muller codeslinear codesmonotone Boolean functionsMAP decodingerasure channelsaffine-invariant codescapacity-achieving codesEXIT functions

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (5)

Boolean functions: influence, threshold and noise ⋮ Alphabet-almost-simple 2-neighbour-transitive codes ⋮ Minimal binary 2-neighbour-transitive codes ⋮ Pseudorandom Functions: Three Decades Later ⋮ Reed-Muller Codes

This page was built for publication: Reed-Muller codes achieve capacity on erasure channels