Erasure coding vs. replication: A quantitative comparison
From MaRDI portal
Recommendations
Cited in
(11)- Bounds on generalized FR codes using hypergraphs
- Linear programming bounds for distributed storage codes
- Stability, efficiency, and contentedness of social storage networks
- A study of the performance of novel storage-centric repairable codes
- Optimistic Erasure-Coded Distributed Storage
- Naming and integrity: Self-verifying data in peer-to-peer systems
- Spread spectrum storage with Mnemosyne
- Verifying distributed erasure-coded data
- Sparsity exploiting erasure coding for distributed storage of versioned data
- On the data persistency of replicated erasure codes in distributed storage systems
- \textsf{SoK}: on cryptography for multi-cloud storage
This page was built for publication: Erasure coding vs. replication: A quantitative comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4709177)