Constituent automorphism decoding of Reed-Muller codes
Yicheng Qu, Amir Tasbihi, and Frank R. Kschischang
TL;DR
This paper introduces a novel soft-decision decoding algorithm for Reed-Muller codes that leverages automorphism-ensemble decoding on Plotkin constituents, achieving improved performance with efficient complexity.
Contribution
It presents a new decoding method based on constituent automorphism decoding, enhancing Reed-Muller code decoding performance and efficiency.
Findings
Achieves state-of-the-art decoding performance
Balances decoding accuracy with computational complexity
Demonstrates effectiveness on Reed-Muller codes
Abstract
Automorphism-ensemble decoding is applied to the Plotkin constituents of Reed-Muller codes, resulting in a new soft-decision decoding algorithm with state-of-the-art performance versus complexity trade-offs.
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
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · DNA and Biological Computing