arXiv (All)
open access
Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
Maximum distance separable (MDS) codes are widely used in distributed storage, but naively repairing a single failure in an $(n,k)$ MDS code requires downloading the full contents of $k$ surviving nodes. Minimum storage regenerating (MSR) codes, introduced by Dimakis et al., minimize repair bandwidt
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
- Optimal Conversion Bandwidth for MDS Convertible Codes in the Split Regime with $r^F<k^F<r^I$#1218084
- New Minimum Storage Regenerating Codes With Small Sub-packetization Levels for All Admissible Repair Degrees#1326579
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- Asymptotically unit-rate storage codes from binary BCH codes#1157004
- Non-RS MDS Codes via Row-Column Twists#670375
Record · ID 1389166
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