Recursive Projection-Aggregation Decoding of Reed-Muller Codes

DOI10.1109/TIT.2020.2977917MaRDI QIDQ5124477zbMATH OpenOpenAlexFDO

Authors Min Ye, Emmanuel Abbe

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.01470

zbMATH Keywords

binary-input memoryless channels

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

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 using list-decoding. We run our algorithm for AWGN channels and Binary Symmetric Channels at the short code length ($le1024$) regime for a wide range of code rates. Simulation results show that in both low code rate and high code rate regimes, the new algorithm outperforms the widely used decoder for polar codes (SCL+CRC) with the same parameters. 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.

Cited in

(8)

• Structural properties of self-dual monomial codes with application to code-based cryptography
• Recursive Decoding and Its Performance for Low-Rate Reed–Muller Codes
• Reed-Muller Codes
• Neural decoders with permutation invariant structure
• The McEliece-type cryptosystem based on D-codes
• Coxeter codes: extending the Reed-Muller family
• On the parameters of a McEliece-type cryptosystem on D-codes based on binary Reed-Muller codes
• Derivative descendants of cyclic codes and constacyclic codes

This page was built for publication: Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124477)