Progressive-edge-growth (PEG) algorithm is known to construct low-density parity-check codes at finite block lengths with very good performance. In this letter, we propose a very simple modification to PEG construction for irregular codes, which considerably improves the performance at high signal-to-noise (SNR) ratios with no sacrifice in low-SNR performance.
No takes yet. Share an insight, caveat, or question.
Xiao et al. (2004) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: