ISTA Publications
metadata only
Sparse multi-decoder recursive projection aggregation for Reed-Muller codes
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
- Decoding rank metric Reed-Muller codes#153696
- The Value of Duplicate Measurements When Decoding Second-Order Reed-Muller Codes#1051054
- Generalized Reed-Muller codes and curves with many points#639171
- Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting#388253
- On the Hamming distance properties of group codes#490073
Record · ID 476216
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