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.
Relation between gcd constraint and full-length row-multiplier qc-ldpc codes with girth eight
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1roles
baseline 1polarities
baseline 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.