{'fraction_non_alphanumeric': 0.018581081081081082, 'fraction_numerical': 0.0, 'mean_word_length': 5.11340206185567, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
LDPC codes based on Progressive Edge Growth techniques for block fading channels

We propose an algorithm to design Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels. The proposed algorithm imposes some restrictions on the traditional PEG algorithm to ensure that the LDPC code generated is Root-Check with the largest possible girth. The performance is investigated by means of the outage probability. By doing so, the codes generated by our proposed algorithm are shown to outperform the existing methods for generating Root-Check LDPC codes.