{
  "slug": "stopping-distance",
  "term": "Stopping distance",
  "aliases": [
    "parity-check stopping distance"
  ],
  "definition": "Stopping distance is the size of the smallest nonempty stopping set for a specified parity-check matrix.",
  "note": "Write s(H): changing the check representation can change this value without changing the code. All patterns with fewer than s(H) erasures are peelable; some larger patterns can also succeed. The bound s(H) <= d(C) uses the code's minimum Hamming distance. [schwartz2006]",
  "related": [
    "ldpc",
    "stopping-set",
    "stopping-redundancy",
    "hamming-distance"
  ],
  "citations": [
    {
      "id": "schwartz2006",
      "title": "Schwartz and Vardy. On the Stopping Distance and the Stopping Redundancy of Codes. arXiv:cs/0503058v2, section II.",
      "url": "https://arxiv.org/pdf/cs/0503058v2",
      "accessed": "2026-11-22"
    }
  ],
  "provenance": [
    "For a nontrivial linear block code, erasure-only peeling continues until completion or no progress, with correct known symbols. This threshold is not a measured NAND failure probability."
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-22"
}
