{'fraction_non_alphanumeric': 0.014360313315926894, 'fraction_numerical': 0.0, 'mean_word_length': 5.087301587301587, '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}}
Distance Threshold Viterbi Decoding of Reed-Muller codes

In this paper we introduce a novel complexity reduction approach for the optimal decoding of Reed-Muller codes that uses Viterbi algorithm. We have adopted the guaranteed error correction capability of the Reed-Muller code, to be used as a simple rule for eliminating some states and branches from the trellis structure of the Reed-Muller block code. The proposed algorithm can be considered a quasi-optimum algorithm as the method of decoding involves a smaller number of summation and comparisons compared to the optimal Viterbi algorithm. The proposed algorithm can achieve a complexity reduction by an order of one-third over both AWGN and Rayleigh fading channels with negligible error performance loss.