{'fraction_non_alphanumeric': 0.022900763358778626, 'fraction_numerical': 0.0, 'mean_word_length': 5.325301204819277, '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 direct approach for decoding product codes

A non-iterative soft decision decoding for direct product codes is discussed. The proposed decoder initially "distorts" the received matrix in a non-linear fashion - matching it to the geometrical properties of a certain, more basic, decoder. Thus, a low complexity decoding algorithm is obtained. On top of providing an efficient stopping criterion within the framework of iterative decoding, the proposed decoder also boosts overall performance for bounded decoding complexity