RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes
Abstract
The Recursive Projection Aggregation (RPA) decoder for Reed-Muller codes uses, in its default implementation, all one-dimensional subspaces at each level of recursion. We restrict our attention to the case where the number of errors is t<dmin/2. It is known that if the number of errors is t<dmin/2, then 2t+1 subspaces at each level of recursion are sufficient to correct these errors. We show that, for structured error patterns, the number of subspaces required for correction can be reduced further by appropriately selecting the subspaces used for projection. In particular, when errors occur as a single burst of length t < dmin/2, three subspaces at each level of recursion suffice for correction. We obtain similar results for multiple bursts and other structured error patterns as well.
Related
- Certified Adaptive List Decoding for Error-Correcting Codes
- Explicit Reed-Solomon Subspace Designs: Optimal List and Line Decoding
- Structured Masked Diffusion for Shared-Codebook Unsourced Random Access Decoding
- Route Based Map Matching via a Structured Codebook and Token Sequence Decoding
- Plotkin-Like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels
BibTeX
@misc{rathore2026decoding,
title = {{RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes}},
author = {Shiv Pratap Singh Rathore and Navin Kashyap},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16240},
eprint = {2610.16240},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16240},
}
RIS
TY - UNPB
TI - RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes
AU - Shiv Pratap Singh Rathore
AU - Navin Kashyap
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.16240
UR - https://arxiv.org/abs/2610.16240
AB - The Recursive Projection Aggregation (RPA) decoder for Reed-Muller codes uses, in its default implementation, all one-dimensional subspaces at each level of recursion. We restrict our attention to the case where the number of errors is t<d_min/2. It is known that if the number of errors is t<d_min/2, then 2t+1 subspaces at each level of recursion are sufficient to correct these errors. We show that, for structured error patterns, the number of subspaces required for correction can be reduced further by appropriately selecting the subspaces used for projection. In particular, when errors occur as a single burst of length t < d_min/2, three subspaces at each level of recursion suffice for correction. We obtain similar results for multiple bursts and other structured error patterns as well.
ER -