Abstract
The progressive-edge-growth (PEG) algorithm (X.-Y. Hu et al., 2001; 2002) is known to construct low-density parity-check codes at finite block lengths with very good performance. We propose a very simple modification to the PEG construction for irregular codes, which considerably improves the performance at high signal-to-noise ratios (SNR) with no sacrifice in low-SNR performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
