arXiv (All)
open access
Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation
Cooperative MSR codes are a kind of storage codes which enable optimal-bandwidth repair of any $h\geq2$ node erasures in a cooperative way, while retaining the minimum storage as an $[n,k]$ MDS code. Each code coordinate (node) is assumed to store an array of $\ell$ symbols, where $\ell$ is termed a
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
- Asymptotically unit-rate storage codes from binary BCH codes#1157004
- LDPC Fractus Codes: Sparse Codes with Recursive Structure#1131091
- On the lengths of MDS codes with a two-transitive permutation automorphism group#972228
- Non-RS MDS Codes via Row-Column Twists#670375
- Non-RS MDS Codes via Row-Column Twists#668310
Record · ID 973953
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