{'fraction_non_alphanumeric': 0.023508137432188065, 'fraction_numerical': 0.007233273056057866, 'mean_word_length': 4.431372549019608, '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}}
Exact evaluation of the Random coding Error probability and Error Exponent

The Clipped union bound is generally used when coding theorems are proved with random coding. As noted by Shulman and Feder [1, Lemma A.2], if the codewords are triple-wise independent, the bound is tight up to factor 12 . In this paper we calculate the exact bound as a function of a CDF of the pairwise error of any word. The method assumes a general metric-based decoder and general channel. Evaluation of the Error Exponent is demonstrated for the mismatched decoding case.