Decoding Reed-Muller Codes Using Redundant Code Constraints
Publication
, Conference
Lian, M; Hager, C; Pfister, HD
Published in: IEEE International Symposium on Information Theory - Proceedings
June 1, 2020
The recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller (RM) codes was recently introduced by Ye and Abbe. We show that the RPA algorithm is closely related to (weighted) belief-propagation (BP) decoding by interpreting it as a message-passing algorithm on a factor graph with redundant code constraints. We use this observation to introduce a novel decoder tailored to high-rate RM codes. The new algorithm relies on puncturing rather than projections and is called recursive puncturing-aggregation (RXA). We also investigate collapsed (i.e., non-recursive) versions of RPA and RXA and show some examples where they achieve similar performance with lower decoding complexity.
Duke Scholars
Published In
IEEE International Symposium on Information Theory - Proceedings
DOI
ISSN
2157-8095
Publication Date
June 1, 2020
Volume
2020-June
Start / End Page
42 / 47
Citation
APA
Chicago
ICMJE
MLA
NLM
Lian, M., Hager, C., & Pfister, H. D. (2020). Decoding Reed-Muller Codes Using Redundant Code Constraints. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2020-June, pp. 42–47). https://doi.org/10.1109/ISIT44484.2020.9174087
Lian, M., C. Hager, and H. D. Pfister. “Decoding Reed-Muller Codes Using Redundant Code Constraints.” In IEEE International Symposium on Information Theory - Proceedings, 2020-June:42–47, 2020. https://doi.org/10.1109/ISIT44484.2020.9174087.
Lian M, Hager C, Pfister HD. Decoding Reed-Muller Codes Using Redundant Code Constraints. In: IEEE International Symposium on Information Theory - Proceedings. 2020. p. 42–7.
Lian, M., et al. “Decoding Reed-Muller Codes Using Redundant Code Constraints.” IEEE International Symposium on Information Theory - Proceedings, vol. 2020-June, 2020, pp. 42–47. Scopus, doi:10.1109/ISIT44484.2020.9174087.
Lian M, Hager C, Pfister HD. Decoding Reed-Muller Codes Using Redundant Code Constraints. IEEE International Symposium on Information Theory - Proceedings. 2020. p. 42–47.
Published In
IEEE International Symposium on Information Theory - Proceedings
DOI
ISSN
2157-8095
Publication Date
June 1, 2020
Volume
2020-June
Start / End Page
42 / 47