Reed–Muller Codes Achieve Capacity on Erasure Channels
From MaRDI portal
Publication:5358571
DOI10.1109/TIT.2017.2673829zbMath1370.94389arXiv1601.04689MaRDI QIDQ5358571
Eren Şaşoğlu, Henry David Pfister, Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Ruediger Urbanke
Publication date: 21 September 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.04689
Related Items (7)
Hypercontractivity for global functions and sharp thresholds ⋮ New classes of affine-invariant codes sandwiched between Reed-Muller codes ⋮ Neural decoders with permutation invariant structure ⋮ Towards a proof of the Fourier-entropy conjecture? ⋮ 2-neighbour-transitive codes with small blocks of imprimitivity ⋮ The all-or-nothing phenomenon in sparse linear regression ⋮ Reed-Muller Codes
This page was built for publication: Reed–Muller Codes Achieve Capacity on Erasure Channels
