fully-absorbing-set · research · also LDPC fully absorbing set

Fully absorbing set

A fully absorbing set is an absorbing set whose outside variables each have strictly more neighbors outside the odd-check set than inside it.

Related Observatory article: Read on hesela.com

Let O(D) be the checks with an odd number of neighbors in selected set D, and let C be all check nodes. Besides the absorbing condition inside D, every outside variable must have strictly more neighbors in C minus O(D) than in O(D). Checks with zero neighbors in D belong to the complement and must be counted. [1]

For rows 110000, 101000, 011000, 100100, 000110, 000101 and 000011, select columns 1-3. Even/odd neighbor counts are 2/1, 2/0, 2/0 inside and 2/1, 2/0, 2/0 outside. This is fully absorbing but not stopping. The final three rows have zero selected neighbors and establish the outside majority. Omitting them would change the classification. This is an exact synthetic graph witness. [2]

A tie does not satisfy the strict definition. In the four-column example 1100, 1010, 0110, 1001, appending 0001 gives the outside variable counts 1/1. A majority bit-flipping rule that leaves ties unchanged is stable there, yet the set is not fully absorbing. Thus stability under that rule is not sufficient for this strict graph definition. [1] [2]

Relations

related
Absorbing set, LDPC (NAND ECC), Stopping set, Trapping set

Citations

  1. Dolecek et al. Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes (2010), Definition 1. DOI 10.1109/TIT.2009.2034781. (accessed 2026-11-22)
  2. Hesela: exact synthetic absorbing-set witnesses and executable parity-count model (accessed 2026-11-22)
Sources & caveats
  • Fully absorbing is used in the strict sense of Dolecek et al. Definition 1, including the outside-node condition. No claim that every iterative decoder remains trapped is made.

JSON: /data/terms/fully-absorbing-set.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. Fully absorbing set. Hesela. 2026-11-22. https://hesela.dev/terms/fully-absorbing-set/