Decoding Reed-Muller Codes Using Redundant Code Constraints

Published

Conference Paper

© 2020 IEEE. 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.

Full Text

Duke Authors

Cited Authors

  • Lian, M; Hager, C; Pfister, HD

Published Date

  • June 1, 2020

Published In

Volume / Issue

  • 2020-June /

Start / End Page

  • 42 - 47

International Standard Serial Number (ISSN)

  • 2157-8095

International Standard Book Number 13 (ISBN-13)

  • 9781728164328

Digital Object Identifier (DOI)

  • 10.1109/ISIT44484.2020.9174087

Citation Source

  • Scopus