{'fraction_non_alphanumeric': 0.031331592689295036, 'fraction_numerical': 0.0, 'mean_word_length': 5.787610619469026, '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}}
Hybrid hard-decision iterative decoding of regular low-density parity-check codes

Hybrid decoding is to combine different iterative decoding algorithms with the aim of improving error performance or decoding complexity. In this work, we introduce "time-invariant" hybrid (HTI) algorithms, and show that for regular low-density parity-check codes and binary message-passing algorithms, HTI algorithms perform remarkably better than their constituent algorithms. We also show that compared to "switch-type" hybrid algorithms, such as Gallager's algorithm B, where a comparable improvement is obtained by switching between different iterative decoding algorithms, HTI algorithms are far less sensitive to channel conditions and thus can be practically more attractive.