Girth-8 regular bipartite graphs can be built with only O(sqrt(n)) check nodes, asymptotically optimal, using sequences free of three-term arithmetic progressions.
A unifying framework to construct QC-LDPC tanner graphs of desired girth,
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
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Bounds and New Constructions for Girth-Constrained Regular Bipartite Graphs
Girth-8 regular bipartite graphs can be built with only O(sqrt(n)) check nodes, asymptotically optimal, using sequences free of three-term arithmetic progressions.