stopping-distance · research · also parity-check stopping distance

Stopping distance

Stopping distance is the size of the smallest nonempty stopping set for a specified parity-check matrix.

Related Observatory article: Read on hesela.com

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

Relations

related
LDPC (NAND ECC), Stopping set, Stopping redundancy, Hamming distance

Citations

  1. Schwartz and Vardy. On the Stopping Distance and the Stopping Redundancy of Codes. arXiv:cs/0503058v2, section II. (accessed 2026-11-22)
Sources & caveats
  • 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.

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

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

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