Erasure coding
Erasure coding encodes data with redundancy so that missing fragments at known locations can be reconstructed from a sufficient, code-dependent set of surviving fragments.
In systematic storage codes, data fragments are accompanied by coding fragments. Storage factor is total encoded bytes divided by payload bytes, while repair cost also depends on the code and failure pattern. Recovery guarantees must be matched to fragment placement and failure domains. Local parity does not generally confer the same any-subset recovery guarantee as an MDS Reed-Solomon code. Surviving fragments must be correct and belong to the expected codeword. An erasure-only decoder assumes known missing positions; accepting silently damaged input is a different fault model. [4]
Relations
- related
- Fountain code, LT code, DNA data storage, Oligonucleotide dropout, RAID, Cold archive tier, Object storage, Reed–Solomon codes (storage), Locally repairable code, Repair locality, Repair-read amplification, Failure domain, CRUSH, Maximum distance separable code, Systematic code, Mean time to data loss (MTTDL), Normalized magnitude of data loss (NOMDL), STAIR code, Sector-disk code, Carbink, Raptor code, RaptorQ