Recursive/Iterative unique Projection-Aggregation of RM codes
Marzieh Hashemipour-Nazari, Renate Debets, Kees Goossens and, Alexios Balatsoukas-Stimming
TL;DR
This paper introduces recursive and iterative unique projection-aggregation decoding methods for Reed-Muller codes, significantly reducing the number of projections needed while maintaining competitive error correction performance.
Contribution
The paper presents novel RUPA and IUPA decoding algorithms that remove non-unique projections, improving efficiency over traditional RPA and IPA methods.
Findings
Up to 95% fewer projections required compared to baseline algorithms
Competitive error-correcting performance achieved
Effective decoding of Reed-Muller codes
Abstract
We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique projections from the recursive projection-aggregation (RPA) and iterative projection-aggregation (IPA) algorithms respectively. We show that these algorithms have competitive error-correcting performance while requiring up to 95% projections less than the baseline RPA algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Algorithms and Data Compression