arXiv (All)
open access
Replica Thresholds for Stripeless Erasure Coding Based on Symmetric Block Designs
This paper investigates a fundamental question in stripeless erasure coding based on symmetric balanced incomplete block designs (SBIBDs): how many replicas per object are precisely required to guarantee recovery from any set of at most $p$ node failures? We refine the known sufficient recovery guar
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
- A Method of Construction of Pairwise Additive Balanced Incomplete Block Designs#662226
- A Method of Construction of Pairwise Additive Balanced Incomplete Block Designs#661176
- Linear Programming Bounds for Locally Recovery Codes II#1110437
- The half-rate linear programming bound for binary codes is $\frac12-\frac1π$#926627
- The Class Edge-Reconstruction Number of a Maximal Planar Graph Is One or Two#924273
Record · ID 1077078
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