Stopping redundancy
Stopping redundancy is the fewest total parity-check rows representing a nontrivial linear block code that attain stopping distance equal to minimum Hamming distance.
Count all rows, not only additions beyond a basis. Including every nonzero dual-codeword row suffices, but need not minimize the count. [1]
Dependent checks do not change rank, code dimension or stored codeword length. Extra decoder equations are therefore distinct from extra stored parity bits. [2]
Relations
Citations
- Schwartz and Vardy. On the Stopping Distance and the Stopping Redundancy of Codes. arXiv:cs/0503058v2, section II.
- Forney. MIT 6.451 lecture notes (2005), sections 13.1 and 13.4: parity checks and binary-erasure decoding.
Sources & caveats
- Theoretical property of a code, not a decoder memory budget, runtime bound or SSD capacity-overhead estimate.