Distributed-storage code

Description

Designed to encode information into spatial nodes such that it is possible to recover said information after failure of some nodes by accessing the remaining nodes with minimal bandwidth. Stub.

Parent

Children

Cousins

References

[1]
M. Asteris and A. G. Dimakis, “Repairable Fountain Codes”, (2014) arXiv:1401.0734
[2]
M. G. Luby et al., “Liquid Cloud Storage”, (2017) arXiv:1705.07983
[3]
H. Dau et al., “Repairing Reed-Solomon Codes With Multiple Erasures”, IEEE Transactions on Information Theory 64, 6567 (2018) arXiv:1612.01361 DOI
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

edit on this site

Zoo Code ID: distributed_storage

Cite as:
“Distributed-storage code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/distributed_storage
BibTeX:
@incollection{eczoo_distributed_storage, title={Distributed-storage code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/distributed_storage} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/distributed_storage

Cite as:

“Distributed-storage code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/distributed_storage

Github: https://github.com/errorcorrectionzoo/eczoo_data/tree/main/codes/classical/q-ary_digits/distributed_storage/distributed_storage.yml.