stopping-redundancy · research · also code stopping redundancy

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.

Related Observatory article: Read on hesela.com

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

related
LDPC (NAND ECC), Stopping set, Stopping distance, Code rate

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)
Sources & caveats
  • Theoretical property of a code, not a decoder memory budget, runtime bound or SSD capacity-overhead estimate.

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

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

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