{'fraction_non_alphanumeric': 0.011450381679389313, 'fraction_numerical': 0.0, 'mean_word_length': 5.5041322314049586, '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}}
Explicit Low-complexity Codes for Multiple Access Channel Resolvability

We design an explicit low-complexity coding scheme that achieves the multiple access channel resolvability region for an arbitrary discrete memoryless multiple access channel whose input alphabets have prime cardinalities. Unlike previous works, we do not assume channel symmetry and rely on rate-splitting to avoid time sharing when it is known to be unnecessary. The idea of our construction is to reduce the problem of multiple access channel resolvability to a combination of several source resolvability problems. Our coding scheme relies on polar codes for source coding to implement source resolvability, and a block Markov coding scheme that performs randomness recycling in the different encoding blocks.