{'fraction_non_alphanumeric': 0.017676767676767676, 'fraction_numerical': 0.0, 'mean_word_length': 4.753623188405797, '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}}
On the Maximum Difference Between Path Metrics in a Viterbi Decoder

The number of bits to be used in the path metric calculus of Viterbi decoders depends logarithmically on the maximum possible difference between any two path metrics. Here, a recent upper bound of Alston and Chau is generalised. In addition, we obtain an easy-to-compute exact expression for the maximum path metric difference.