A New Permutation Decoding Method for Reed-Muller Codes

A novel permutation decoding method for Reed-Muller codes is presented. The complexity and the error correction performance of the suggested permutation decoding approach are similar to that of the recursive lists decoder. It is demonstrated that the proposed decoding technique can take advantage of several early termination methods leading to a significant reduction of the operations number required for the decoding, with the error correction performance being the same.

[1]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[2]  Alexios Balatsoukas-Stimming,et al.  LLR-Based Successive Cancellation List Decoding of Polar Codes , 2013, IEEE Transactions on Signal Processing.

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

[4]  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..

[5]  Sarah J. Johnson,et al.  Iterative Error Correction: Turbo, Low-Density Parity-Check and Repeat-Accumulate Codes , 2009 .

[6]  Athanasios Papoulis,et al.  Probability, Random Variables and Stochastic Processes , 1965 .

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

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

[9]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[10]  Peter Trifonov,et al.  Efficient Design and Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

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