{'fraction_non_alphanumeric': 0.02336448598130841, 'fraction_numerical': 0.0, 'mean_word_length': 4.6902654867256635, '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}}
The Static Broadcast Channel

In this paper we present a different view on the broadcast channel that fits better an asynchronous setting, where each receiver can “listen” to the broadcasted data at different time intervals. In the scenario we suggest, there is a “static” fixed amount of data, that needs to be transmitted to all receivers. Each receiver wants to minimize the receiving time, and this way to get the static data at the highest possible rate. We define the capacity region for this scenario, show a coding theorem, and provide a few examples. We finally point out several further work and possible extensions to this concept.