{'fraction_non_alphanumeric': 0.03017241379310345, 'fraction_numerical': 0.0028735632183908046, 'mean_word_length': 4.620967741935484, '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}}
On the capacity of the one-bit deletion and duplication channel

The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of l ≥ 1 bits which experiences a deletion with probability p, a duplication with probability q, and remains unchanged with probability 1 - p - q. For this channel a capacity expression is obtained in the asymptotic regime where p + q = o(l/logl). As a corollary, we obtain an asymptotic expression for the capacity of the so called “segmented” deletion and duplication channel where the input now consists of several blocks and each block independently experiences either a deletion, or a duplication, or remains unchanged.