{'fraction_non_alphanumeric': 0.04838709677419355, 'fraction_numerical': 0.008064516129032258, 'mean_word_length': 4.803738317757009, '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}}
An elementary proof of the strong converse theorem for the multiple-access channel

In [1] we determined the capacity region of the multiple–access channel (MAC) by proving a coding theorem and its weak converse. Recently Dueck [2] proved a strong converse theorem in the sense of Wolfowitz [3]. His proof uses the Ahlswede–Gács–Körner [4] method of “blowing up decoding sets” in conjunction with a new “wringing technique”. This technique makes it now possible to prove strong converses, if the average error probability criterion is genuinely used (as in the case in the results for the MAC mentioned above, c.f. [5]).