{
  "slug": "stopping-redundancy",
  "term": "Stopping redundancy",
  "aliases": [
    "code stopping redundancy"
  ],
  "definition": "Stopping redundancy is the fewest total parity-check rows representing a nontrivial linear block code that attain stopping distance equal to minimum Hamming distance.",
  "note": "Count all rows, not only additions beyond a basis. Including every nonzero dual-codeword row suffices, but need not minimize the count. [schwartz2006]\n\nDependent checks do not change rank, code dimension or stored codeword length. Extra decoder equations are therefore distinct from extra stored parity bits. [forney2005]",
  "related": [
    "ldpc",
    "stopping-set",
    "stopping-distance",
    "code-rate"
  ],
  "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"
    }
  ],
  "provenance": [
    "Theoretical property of a code, not a decoder memory budget, runtime bound or SSD capacity-overhead estimate."
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-22"
}
