Locally repairable code
A locally repairable code is an erasure code that provides recovery of specified missing fragments from a small subset of surviving fragments.
Data locality and all-fragment locality differ: a global-parity repair need not have the same cost as a data-fragment repair. The code construction determines which erasure patterns remain decodable; local redundancy is not interchangeable with global redundancy.
Relations
- related
- erasure-coding, reed-solomon-code, repair-locality, repair-read-amplification