Description
Block code designed to encode information into spatial nodes such that it is possible to recover said information after failure of some helper nodes by accessing the remaining nodes with minimal bandwidth.
Protection
Typically designed to protect a distributed storage system against the failure of a single node or multiple nodes.
Notes
Parent
Children
- Array code
- Regenerating code (RGC)
- Sum-rank-metric code — Sum-rank-metric codes are useful for distributed storage [3].
- Code with locality
- \(t\)-erasure LRC
- Generalized RS (GRS) code — GRS codes are used in various cloud storage systems [4].
Cousin
- Fountain code — There are proposals [5,6] adapting fountain codes to distributed storage systems.
References
- [1]
- V. Ramkumar, M. Vajha, S. B. Balaji, M. Nikhil Krishnan, B. Sasidharan, P. Vijay Kumar, "Codes for Distributed Storage." Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
- [2]
- I. F. Blake, Essays on Coding Theory (Cambridge University Press, 2024) DOI
- [3]
- U. Martínez-Peñas and F. R. Kschischang, “Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes”, (2019) arXiv:1809.11158
- [4]
- H. Dau et al., “Repairing Reed-Solomon Codes With Multiple Erasures”, IEEE Transactions on Information Theory 64, 6567 (2018) arXiv:1612.01361 DOI
- [5]
- M. Asteris and A. G. Dimakis, “Repairable Fountain Codes”, (2014) arXiv:1401.0734
- [6]
- M. G. Luby et al., “Liquid Cloud Storage”, (2017) arXiv:1705.07983
Page edit log
- Fengxing Zhu (2024-03-16) — most recent
- Victor V. Albert (2024-03-16)
- Victor V. Albert (2022-03-22)
Cite as:
“Distributed-storage code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/distributed_storage