{
  "slug": "stopping-set",
  "term": "Stopping set",
  "aliases": [
    "LDPC stopping set"
  ],
  "definition": "A stopping set is a subset of columns of a specified parity-check matrix whose restriction has no row containing exactly one nonzero entry.",
  "note": "Erasure peeling solves a check with one unknown and substitutes the recovered value into other checks. Peeling cannot recover erased variables in a nonempty stopping set, although it may recover others. The empty set is allowed by convention but does not signify failure. [forney2005] [schwartz2006]\n\nPeeling failure does not establish algebraic ambiguity. The linked XOR example has a unique solution without an initial single-unknown equation. [example]",
  "related": [
    "ldpc",
    "stopping-distance",
    "stopping-redundancy",
    "lt-code"
  ],
  "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"
    },
    {
      "id": "forney2005",
      "title": "Forney. MIT 6.451 lecture notes (2005), sections 13.1 and 13.4: parity checks and binary-erasure decoding.",
      "url": "https://ocw.mit.edu/courses/6-451-principles-of-digital-communication-ii-spring-2005/bb895c1dee9ce0b39d6846e0aa984981_MIT6_451S05_FullLecNotes.pdf",
      "accessed": "2026-11-22"
    },
    {
      "id": "example",
      "title": "Hesela: exact synthetic XOR equation, rank and peeling observations",
      "url": "https://hesela.dev/research/fountain-rank/observations.json",
      "accessed": "2026-11-22"
    }
  ],
  "provenance": [
    "Binary-erasure decoding assumes the surviving symbols are correct. It is not a noisy NAND soft-decoding performance model."
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-22"
}
