{'fraction_non_alphanumeric': 0.018518518518518517, 'fraction_numerical': 0.0, 'mean_word_length': 5.756944444444445, '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 generalized distributed rateless coding scheme for non-cooperative multi-source transmissions

Rateless codes are representative capacity achieving codes for the binary erasure channels. We consider a network where multiple noncooperative sources with arbitrarily correlated messages communicate with a single destination. The conventional distributed rateless coding scheme introduces a general And-or tree analysis and provides linear programming (LP) based solutions only for some special cases. However, in this paper, an optimization method applicable to all the cases is proposed. Based on the generalized analysis, we define a new objective and employ the sequential quadratic programming (SQP) algorithm to solve the problem. The obtained solution contains optimal degree distributions and symbol-selection weights. It is shown that the proposed scheme exhibits the reduced overhead at the higher symbol recovery rate region compared to the conventional schemes.