{'fraction_non_alphanumeric': 0.023943661971830985, 'fraction_numerical': 0.0, 'mean_word_length': 4.925, '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}}
Non-Asymptotic Performance of Symmetric Slepian-Wolf Coding

Like most results in information theory, the classical Slepian-Wolf theorem is asymptotic. We characterize how quickly the limits put forth by in- formation theory can be reached. Our contribution is two-fold. First, we investigate the non-asymptotic regime for two binary sources that generate sequences with a symmetric joint distribution. Second, we pro- vide tight converse and achievable bounds and also show how to construct codes for any rate pair within the feasible rate region. The key result is that the feasible rate region for the non-asymptotic regime is obtained by translating the corresponding rate region for the asymptotic regime.