{'fraction_non_alphanumeric': 0.02247191011235955, 'fraction_numerical': 0.0, 'mean_word_length': 5.369047619047619, '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}}
A REVIEW OF CONSTRUCTION METHODS FOR REGULAR LDPC CODES

Low-Density parity-check (LDPC) codes are one of the most powerful error correcting codes available today. Their Shannon capacity approaching performance and lower decoding complexity have made them the best choice for many wired and wireless applications. This paper gives an overview about LDPC codes and compares the Gallager’s method, Reed-Solomon based algebraic method and the Progressive edge growth (PEG) combinatorial method for the construction of regular LDPC codes.