{'fraction_non_alphanumeric': 0.009633911368015413, 'fraction_numerical': 0.0, 'mean_word_length': 5.040697674418604, '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}}
Improving the decoding performance of the PTA algorithm for RS codes through the extension of the parity check matrix

The Parity check Transformation Algorithm (PTA) is a recently developed symbol wise soft decision decoding algorithm for Reed Solomon codes. The algorithm has been shown in literature to outperform widely used Reed Solomon decoders including the Koetter and Vardy (KV) algorithm. The PTA gets its name from the fact that it transforms the parity check matrix of the Reed Solomon code after every iteration depending on the reliability of each symbol initially obtained from the output of the channel. The major disadvantage of the PTA algorithm is that it requires numerous iterations to decode. In this paper an extension of the algorithm is developed with the aim of improving the performance and reducing the number of iterations required to decode. Simulations run show that using an extended H matrix provides a significant reduction in the number of iterations required to decode without any SER performance loss.