{'fraction_non_alphanumeric': 0.0108499095840868, 'fraction_numerical': 0.0, 'mean_word_length': 4.8936170212765955, '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}}
Capacity of random network coding under a probabilistic error model

A probabilistic error model for random network coding is considered. An upper bound on capacity is obtained for any channel parameters, and asymptotic expressions are provided in the limit of long packet length and/or large field size. A simple and efficient coding scheme is provided that achieves capacity in both limiting cases. The scheme has zero error probability and a probability of failure that decreases exponentially both in the packet length and in the field size in bits.