Stopping distance
Stopping distance is the size of the smallest nonempty stopping set for a specified parity-check matrix.
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
Citations
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.