stopping-set · research · also LDPC stopping set

Stopping set

A stopping set is a subset of columns of a specified parity-check matrix whose restriction has no row containing exactly one nonzero entry.

Related Observatory article: Read on hesela.com

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. [2] [1]

Peeling failure does not establish algebraic ambiguity. The linked XOR example has a unique solution without an initial single-unknown equation. [3]

Relations

related
LDPC (NAND ECC), Stopping distance, Stopping redundancy, LT code

Citations

  1. Schwartz and Vardy. On the Stopping Distance and the Stopping Redundancy of Codes. arXiv:cs/0503058v2, section II. (accessed 2026-11-22)
  2. Forney. MIT 6.451 lecture notes (2005), sections 13.1 and 13.4: parity checks and binary-erasure decoding. (accessed 2026-11-22)
  3. Hesela: exact synthetic XOR equation, rank and peeling observations (accessed 2026-11-22)
Sources & caveats
  • Binary-erasure decoding assumes the surviving symbols are correct. It is not a noisy NAND soft-decoding performance model.

JSON: /data/terms/stopping-set.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Stopping set. Hesela. 2026-11-22. https://hesela.dev/terms/stopping-set/