{'fraction_non_alphanumeric': 0.01921229586935639, 'fraction_numerical': 0.0, 'mean_word_length': 5.165680473372781, '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}}
Bit level implementation of the PTA algorithm for reed-solomon codes

The Parity check Transformation Algorithm (PTA) is a symbol level decoder that was recently developed for Reed-Solomon (RS) codes. The algorithm is a soft decision iterative decoder that uses the reliability information to decode by transforming the parity check matrix based on the same soft information. The PTA algorithm has been shown in literature to outperform widely used RS decoders like the Berlekamp-Massey algorithm and Koetter-Vardy algorithm. Work done in this paper investigates the effect of the PTA algorithm working on a sparse matrix by implementing it on a bit level. Modifications are made to the algorithm, to suit the bit level implementation, that significantly improve the overall performance. Simulations run show that the algorithm compares favorably to the high performance Adoptive Belief Propagation (ABP) decoder, that also works on a bit level, while providing a significant gain when compared to the symbol level implementation of the PTA.