Reproduce “Recursive projection-aggregation decoding of Reed-Muller codes” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Min Ye, Emmanuel Abbe
New Recursive Projection-Aggregation (RPA) decoding algorithms for Reed-Muller (RM) codes show approximately 0.5 dB performance gains compared to state-of-the-art polar code decoders (SCL+CRC) for short block lengths. These decoders achieve near-Maximal Likelihood performance and offer faster decoding times for many code configurations, particularly for second-order and high-rate RM codes.
Key insights
- The self-similar structure of Reed-Muller codes can be effectively exploited through a recursive projection-aggregation framework to achieve near-Maximal Likelihood decoding.
- The RPA algorithm's inherent parallelizability provides a structural advantage for high-throughput and low-latency hardware implementations, differentiating it from inherently sequential SCL decoders.
- Reed-Muller codes exhibit a sharper transition in decoding error probability on Binary Symmetric Channels, suggesting better scaling properties compared to polar codes under RPA decoding.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.