Description
A \(t\)-availability parallel-recovery code is a code such that coordinates can be recovered in multiple ways. The availability of a locally recoverable code is the minimum, over all coordinates, of the number of recovery sets for that coordinate [3; Def. 15.9.20]. That way, the code accommodates nodes that may be inaccessible during the recovery procedure.Cousins
- Locally recoverable code (LRC)— Availability is the number of recovery sets available for each coordinate of an LRC [3; Def. 15.9.20].
- Barg-Tamo-Vladut code— Fibre-product constructions of Barg-Tamo-Vladut codes yield LRCs with availability \(2\) [3; Thm. 15.9.21].
Member of code lists
Primary Hierarchy
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
- [3]
- A. Couvreur, H. Randriambololona, “Algebraic Geometry Codes and Some Applications.” Concise Encyclopedia of Coding Theory (Chapman and Hall/CRC, 2021) DOI
Page edit log
- Victor V. Albert (2022-03-22) — most recent
- Victor V. Albert (2021-11-22)
Cite as:
“Availability code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/codes_with_availability