erasure-coding · shipping

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

Citations

  1. Lacan, Roca, Peltotalo and Peltotalo. RFC 5510 (2009), sections 3.1, 8.2-8.4: systematic encoding and the erasure-channel assumption. (accessed 2026-10-13)

Further reading

  1. Erasure coding (accessed 2026-03-26)
  2. Ceph Reef: Erasure code, overhead and failure-domain placement (accessed 2026-10-11)
  3. Local repair is not whole-node repair (accessed 2026-10-11)

JSON: /data/terms/erasure-coding.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Erasure coding. Hesela. 2026-11-21. https://hesela.dev/terms/erasure-coding/