Answers are grounded in this paper and cite their sources.
In this letter, we propose a generalization of the progressive edge-growth (PEG) algorithm with the aim of designing LDPC code graphs with substantially improved approximated cycle extrinsic message degree (ACE) properties. The proposed realization of generalized PEG algorithm outperforms original PEG algorithm and its subsequent modification proposed by Xiao and Banihashemi.
No takes yet. Share an insight, caveat, or question.
Vukobratović et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: