Answers are grounded in this paper and cite their sources.
Some explicit constructions for exponent matrices which correspond to Tanner graphs with girth at least eight are proposed. From these results, for any row weight of L>3, (3,L) quasi-cyclic LDPC codes with girth at least eight are constructed for any circulant permutation matrix (CPM) size P>L(L+mod(L,2))/2.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2013) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: