arXiv (All)
open access
RPA Decoding with Few Subspace Projections for Correcting Structured Error Patterns in RM Codes
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_{\mathrm{min}}/2$. It is known that if the number of errors
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Perfect Reconstruction Cannot Show Whether Two Codebooks on a VAE's Latent Space Agree#1324613
- Insdel Reed-Solomon Decoding Algorithms up to the Half-Singleton Bound#1326663
- Discrepancy for Random Linear Codes#1142724
- ECMA-151 — Data compression for information interchange - Adaptive coding with embedded dictionary - DCLZ algorithm (June 1991)#600454
- Revisiting Shannon's Source Coding Theorem with Distributional Uncertainty under the Nonlinear Expectation Theory#625125
Record · ID 1327830
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive