Permutation-based Decoding of Reed-Muller Codes in Binary Erasure Channel

In this paper, we consider the problem of decoding Reed-Muller (RM) codes in binary erasure channel. We propose a novel algorithm, which exploits several techniques, such as list recursive (successive cancellation) decoding based on Plotkin decomposition, permutations of encoding factor graph as well as the properties of erasure channels.We show that with properly selected number of random permutations, this algorithm considerably outperforms straightforward list decoding while maintaining the same asymptotic complexity. This also means that near-MAP decoding can be achieved with lower complexity cost.

[1]  Warren J. Gross,et al.  On the Decoding of Polar Codes on Permuted Factor Graphs , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[2]  Rüdiger L. Urbanke,et al.  On the scaling of polar codes: I. The behavior of polarized channels , 2010, 2010 IEEE International Symposium on Information Theory.

[3]  David E. Muller,et al.  Application of Boolean algebra to switching circuit design and to error detection , 1954, Trans. I R E Prof. Group Electron. Comput..

[4]  Erdal Arikan,et al.  Channel polarization: A method for constructing capacity-achieving codes , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  Valentin Savin,et al.  Enhanced recursive Reed-Muller erasure decoding , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[6]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[7]  Warren J. Gross,et al.  Decoding Reed-Muller and Polar Codes by Successive Factor Graph Permutations , 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

[8]  Vera Miloslavskaya,et al.  Polar Subcodes , 2015, IEEE Journal on Selected Areas in Communications.

[9]  Stephan ten Brink,et al.  Belief propagation decoding of polar codes on permuted factor graphs , 2018, 2018 IEEE Wireless Communications and Networking Conference (WCNC).

[10]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[11]  Irving S. Reed,et al.  A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[12]  Santhosh Kumar,et al.  Reed–Muller Codes Achieve Capacity on Erasure Channels , 2015, IEEE Transactions on Information Theory.

[13]  Ilya Dumer,et al.  Soft-decision decoding of Reed-Muller codes: recursive lists , 2006, IEEE Transactions on Information Theory.

[14]  Ahmed Elkelesh,et al.  Belief Propagation List Decoding of Polar Codes , 2018, IEEE Communications Letters.