[Jump to code hierarchy]

Availability code[1,2]

Description

A \(t\)-availability parallel-recovery code is a code such any \(t\) coordinates can be recovered in multiple ways. That way, the code accomodates nodes that may be inaccessible during the recovery procedure.

Member of code lists

Primary Hierarchy

Classical Domain
Galois-field Kingdom
\(q\)-ary codeECC
Sequential-recovery codeDistributed-storage ECC
Parallel-recovery code
Parents
Parallel-recovery code
Availability code

References

[1]
A. Wang and Z. Zhang, “Repair Locality With Multiple Erasure Tolerance”, IEEE Transactions on Information Theory 60, 6979 (2014) arXiv:1306.4774 DOI
[2]
A. Wang and Z. Zhang, “Achieving Arbitrary Locality and Availability in Binary Codes”, (2015) arXiv:1501.04264
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: codes_with_availability

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

Cite as:

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

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