{'fraction_non_alphanumeric': 0.03187250996015936, 'fraction_numerical': 0.0, 'mean_word_length': 5.1656441717791415, '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}}
Symbol-Based Belief Propagation Decoding of Reed-Solomon Codes

We propose a symbol-based belief propagation (BP) algorithm for iterative soft-decision decoding of Reed-Solomon (RS) codes. Complexity reduction is achieved by using a fast Fourier transform (FFT)-based BP algorithm. Parity-check matrix adaptation based on the reliability of the codeword symbols is an essential step to make the BP algorithm effective on high-density parity-check matrices characteristic of RS codes. The matrix adaptation, as well as all other operations, is performed at symbol level such that bit-to-symbol and symbol-to- bit conversions are avoided. A moderate coding gain over algebraic hard-decision decoding is achieved on additive white Gaussian noise channels. The symbol-based algorithm presented in this paper addresses the main weakness of its bit-based counterpart, namely the prohibitively high complexity for practical applications that use long codes and large finite fields, albeit with less coding gain.