{'fraction_non_alphanumeric': 0.04144385026737968, 'fraction_numerical': 0.016042780748663103, 'mean_word_length': 4.674242424242424, '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}}
Exact repair problems with multiple sources

We consider a new variant of the exact repair distributed storage problem, the multi-source exact repair problem, wherein the reconstruction decoders are each only required to provide a subset of the source variables. To best illustrate the idea, we generalize the (n, k, d) = (3, 2, 2) exact repair distributed storage problem to the multisource case. When every decoder demands all source variables, the rate region of the (3, 2, 2) exact repair problem is known to be same as that of the (3, 2, 2) functional repair problem, while the rate region for (3, 2, 2) case with multiple sources is unknown. We find achievable rate regions for vector binary and scalar binary codes via an automated approach.