{
  "slug": "locally-repairable-code",
  "term": "Locally repairable code",
  "aliases": [
    "LRC",
    "local reconstruction code"
  ],
  "definition": "A locally repairable code is an erasure code that provides recovery of specified missing fragments from a small subset of surviving fragments.",
  "note": "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.",
  "related": [
    "erasure-coding",
    "reed-solomon-code",
    "repair-locality",
    "repair-read-amplification"
  ],
  "citations": [
    {
      "id": "ceph-lrc",
      "title": "Ceph: Locally Repairable Erasure Code Plugin (development documentation; parameter names are implementation-specific).",
      "url": "https://docs.ceph.com/en/latest/rados/operations/erasure-code-lrc/",
      "accessed": "2026-10-11"
    },
    {
      "id": "hesela-lrc",
      "title": "Local repair is not whole-node repair",
      "url": "https://hesela.com/analyses/lrc-repair-costs-locality/",
      "accessed": "2026-10-11"
    }
  ],
  "status": "shipping",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-11"
}