{'fraction_non_alphanumeric': 0.03484320557491289, 'fraction_numerical': 0.0017421602787456446, 'mean_word_length': 5.534090909090909, '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}}
New Finite Blocklength Converses for Asymmetric Multiple Access Channels via Linear Programming

This paper presents a systematic method to synthesize new finite blocklength converses for the channel coding of asymmetric multiple access channels (A-MAC) from point-to-point converses, by employing the linear programming (LP) based framework in [1]. A direct synthesis yields a converse that extends the Polyanskiy-Poor-Verdú metaconverse to A-MAC. Employing a more sophisticated non-linear synthesis, we derive a new, code-independent converse that is asymptotically tight.