{'fraction_non_alphanumeric': 0.026984126984126985, 'fraction_numerical': 0.0, 'mean_word_length': 5.0095238095238095, '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}}
A Study on Universally Good Fractional Repetition Codes

Fractional repetition (FR) codes are introduced with the aim of facilitating node repairs in distributed storage systems, i.e., they enable uncoded exact repairs at the minimum bandwidth regenerating (MBR) point. In this letter, we investigate universally good FR (UGFR) codes, which can achieve the storage capacity of MBR codes. We show that UGFR codes are optimal with respect to a bound on the reconstruction degree, which is the number of nodes required for data retrieval. We also present a construction of UGFR codes by establishing a relation with regular packings.