arXiv (All)
open access
Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance
In this work, we propose an efficient decoding algorithm for codes arising from simplicial complexes, a family of binary linear codes for which no decoding method of this type was previously known. Although the algorithm does not always attain the maximum theoretical error-correcting capability, i
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
- Efficient Polynomial-Time Decoding of Simplicial Anticodes with Near-Optimal Performance#796858
- Asymptotically unit-rate storage codes from binary BCH codes#1157004
- Edge codes constructed from unicyclic graphs#799611
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation#973953
Record · ID 798271
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