Technical Program

Paper Detail

Paper Title Recursive projection-aggregation decoding of Reed-Muller codes
Paper IdentifierTH2.R7.4
Authors Min Ye, Princeton University, United States; Emmanuel Abbe, École polytechnique fédérale de Lausanne, Switzerland and Princeton University, United States
Session Rank Metric Codes
Location Bièvre, Level 5
Session Time Thursday, 11 July, 11:40 - 13:00
Presentation Time Thursday, 11 July, 12:40 - 13:00
Manuscript  Click here to download the manuscript
Abstract We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM codes), and aggregating the reconstructions (e.g., using majority votes). We further provide extensions of the algorithms based on list-decoding algorithms and code concatenation. We run our main algorithm for AWGN channels and Binary Symmetric Channels at the short code length ($\le 1024$) and low code rate ($\le 0.5$) regime. Simulation results show that the new algorithm not only outperforms the previous decoding algorithms for RM codes, it also outperforms the optimal decoder for polar codes (SCL+CRC) with the same parameters by a wide margin. The performance of the new algorithm for RM codes in those regimes is in fact close to that of the maximal likelihood decoder. Finally, the new decoder naturally allows for parallel implementations.