Math @ Duke
|
Publications [#352263] of Henry Pfister
Papers Published
- Lian, M; Hager, C; Pfister, HD, Decoding Reed-Muller Codes Using Redundant Code Constraints,
Ieee International Symposium on Information Theory Proceedings, vol. 2020-June
(June, 2020),
pp. 42-47, ISBN 9781728164328 [doi]
(last updated on 2023/06/01)
Abstract: 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.
|
|
dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
| |
Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320
|
|