Semantic Scholar
metadata only
Explicit construction of optimal exact regenerating codes for distributed storage
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
- Regenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth#629896
- Regenerating codes with minimal disk I/O cost achieving optimal tradeoff between storage and repair bandwidth#628034
- Asymptotically unit-rate storage codes from binary BCH codes#1157004
- Improving reliability and performances in large scale distributed applications with erasure codes and replication#16718
- Optimal-Access Cooperative MSR Codes: Parity-Check Matrix Construction And a Unified Transformation#973953
Record · ID 328659
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