Turán numbers yield the bound b ≥ aγ − a(√(24a−23)−1)/4 on (a,b)-ETS in 8-girth variable-regular LDPC codes when no two 8-cycles share a variable node, and chord removal eliminates small ETS.
On the construction of ldpc codes free of small trapping sets by controlling cycles
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Tur\'{a}n-Theoretic Bounds on Several Elementary Trapping Sets in LDPC Codes
Turán numbers yield the bound b ≥ aγ − a(√(24a−23)−1)/4 on (a,b)-ETS in 8-girth variable-regular LDPC codes when no two 8-cycles share a variable node, and chord removal eliminates small ETS.