Reed-Muller Codes Achieve Capacity on Erasure Channels

  title={Reed-Muller Codes Achieve Capacity on Erasure Channels},
  author={Shrinivas Kudekar and Santhosh Kumar and Marco Mondelli and Henry D. Pfister and Eren Sasoglu and R{\"u}diger L. Urbanke},
  journal={IEEE Trans. Inf. Theory},
We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, our method exploits code symmetry. In particular, the technique applies to any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive. In other words, we show that symmetry… 

Figures from this paper

Reed–Muller Codes Achieve Capacity on Erasure Channels
This work shows that symmetry alone implies near-optimal performance in any sequence of linear codes where the blocklengths are strictly increasing, the code rates converge, and the permutation group of each code is doubly transitive.
On locality of Generalized Reed-Muller codes over the broadcast erasure channel
The purpose is to investigate the use of Generalized Reed Muller codes and the value of their locality property in their progressive decoding for Broadcast/Multicast communication schemes with real time video delivery.
Polar Subcodes
An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbol, to be data-dependent, and is shown to outperform LDPC and turbo codes, as well as polar codes with CRC.
Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel
This paper shows that the result of Delfosse et al is tight: one can construct capacity approaching codes with weight almost almost as much as the capacity itself.
Evolution of the McEliece Public Key Encryption Scheme
This article analyzes the evolution of the main encryption variants coming from the Rank based cryptography and stresses out the main security issues and point out some new ideas coming from this field.
On codes decoding a constant fraction of errors on the BSC
It is shown that a linear code that is successful on the BEC can also decode over a range of binary memoryless symmetric (BMS) channels and it is proved that a Reed–Muller code of positive rate R decodes errors on the p with high probability if p < 1/2 − √2−R(1−2− R).
Towards a Proof of the Fourier-Entropy Conjecture?
A new concentration result on the Fourier spectrum of Boolean functions with small total influence implies that the class of functions whose total influence is at most $K$ is agnostically learnable in time $2^{O(K\log K)}$, using membership queries.


Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels
It is shown that sequences of cyclic codes, whose blocklengths satisfy the above conditions, achieve capacity on the q-ary erasure channel if all prime divisors of t tend to infinity.
Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels
This work presents an alternative approach to strengthen results regarding the bit-MAP threshold to block-MAP thresholds, based on a careful analysis of the weight distribution of RM codes.
Reed-Muller Codes for Random Erasures and Errors
This paper studies the parameters for which binary Reed–Muller (RM) codes can be decoded successfully on the binary erasure channel and binary symmetry channel, and, in particular, when can they
Reed-muller codes achieve capacity on the quantum erasure channel
This article shows that Calderbank-Shor-Steane (CSS) stabilizer codes constructed from self-orthogonal binary linear codes are capacity-achieving on the quantum erasure channel if the binarylinear codes arecapacity-achieved on the binary erasure channels.
From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance
Empirically the performance of polar codes at finite block lengths is boosted by moving along the family C-inter even under low-complexity decoding schemes such as, for instance, belief propagation or successive cancellation list decoder.
Good Error-Correcting Codes Based on Very Sparse Matrices
  • D. Mackay
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1999
It is proved that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit, and experimental results for binary-symmetric channels and Gaussian channels demonstrate that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Locally Decodable Codes
This book introduces and motivates locally decodable codes, and discusses the central results of the subject, with the main focus on the recent constructions of codes from families of “matching” vectors.
Efficient erasure correcting codes
A simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs is introduced and a simple criterion involving the fractions of nodes of different degrees on both sides of the graph is obtained which is necessary and sufficient for the decoding process to finish successfully with high probability.
Recursive decoding and its performance for low-rate Reed-Muller codes
  • I. Dumer
  • Computer Science
    IEEE Transactions on Information Theory
  • 2004
To evaluate decoding capability, a probabilistic technique is developed that disintegrates decoding into a sequence of recursive steps and subsequent outputs can be tightly evaluated under the assumption that all preceding decodings are correct.
Good codes can be produced by a few permutations
It is shown that good codes, even those meeting the random coding bound, can be produced with relatively few (linear in the block length) permutations from a single codeword, which explains why good codes of a Iow complexity (such as those produced by) are hard to miss if selected at random.