Codes for Distributed Storage
From MaRDI portal
Abstract: This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of ensuring reliability against data loss while minimizing storage overhead. More recently, a third concern has surfaced, namely of the need to efficiently recover from the failure of a single storage unit, corresponding to recovery from the erasure of a single code symbol. We explain here, how coding theory has evolved to tackle this fresh challenge.
Recommendations
- Codes for Distributed Storage
- Cascade Codes for Distributed Storage Systems
- Network Coding for Distributed Storage Systems
- Regenerating codes for distributed storage networks
- Coded Caching With Distributed Storage
- Graftage Coding for Distributed Storage Systems
- BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems
- Distributed Storage Allocations
Cited in
(8)- Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs
- Channel coding methods for non-volatile memories
- Robust Distributed Storage of Residue Encoded Data
- Regenerating codes for distributed storage networks
- Network Coding for Distributed Storage Systems
- Codes for Distributed Storage
- Codes in the sum-rank metric: fundamentals and applications
- Recursive methods for some problems in coding and random permutations
This page was built for publication: Codes for Distributed Storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013057)
