{'fraction_non_alphanumeric': 0.0087527352297593, 'fraction_numerical': 0.0, 'mean_word_length': 4.871794871794871, '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 optimality of a construction of secure network codes

In this paper, we prove the optimality of a secure network code we have previously constructed when the wiretapper can choose to access any subset of the channels of a fixed size. Specifically, we prove that the network code we constructed multicasts the maximum possible amount of information to the user nodes securely and uses the minimum amount of randomness to achieve the required security.