{'fraction_non_alphanumeric': 0.019036954087346025, 'fraction_numerical': 0.0, 'mean_word_length': 5.478260869565218, '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}}
Reduced Complexity Ordered Statistics Decoding of Linear Block Codes

This paper proposes a reduced complexity ordered statistics decoding (OSD) algorithm for linear block codes. With the received information, several most reliable positions in the ordered reliability sequence are prioritized as the validation band (VB). The Gaussian elimination (GE) is then performed to generate the systematic generator matrix of the code. In the process of re-encoding, only the test messages that satisfy the validation rule would be used to generate the codeword candidates, resulting in a low decoding complexity. The decoding error probability upper bound of the proposed OSD is further analyzed to characterize its performance-complexity trade off. Our simulation results show that the proposed OSD can significantly reduce the decoding complexity with a negligible loss in the decoding performance.