{'fraction_non_alphanumeric': 0.02720527617477329, 'fraction_numerical': 0.0016488046166529267, 'mean_word_length': 5.322916666666667, '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}}
Efficient decoding of generalized low-density parity-check codes based on long component codes

A class of pseudo-random compound error-correcting codes, called generalized low density (GLD) parity-check codes, has been proposed recently. As a generalization of Gallager's low-density parity check (LPDC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individual constituent codes. The code performance and decoding complexity of GLD codes are heavily dependent on the employed SISO decoding algorithm. In this paper, we present an efficient SISO decoding algorithm for GLD codes. The proposed algorithm utilizes Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft-decision using reliability calculations. The algorithm proposed here presents a major advantage over existing decoding algorithms for GLD codes by being applicable even when long and powerful component codes are used. The complexity of the proposed algorithm is less than that of trellis-based decoding algorithms with a performance degradation of only 0.3 dB.