{'fraction_non_alphanumeric': 0.022518765638031693, 'fraction_numerical': 0.003336113427856547, 'mean_word_length': 5.315789473684211, '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}}
Efficient Reliable Wireless Communications through Raptor Codes and Rateless Codes with Feedback

Multi-connectivity can increase the reliability of wireless communications by orders of magnitude due to an increased diversity. However, simply copying packets and sending them on multiple links in parallel, i. e., as standardized as packet duplication, will result in a wasteful scheme. For example, there is no benefit in receiving the same information more often than once if multiple links succeed. This drawback can be resolved by channel coding. In a previous work, we proposed packet transmission schemes based on rateless codes, which could already increase resource efficiency compared to packet duplication. Here, we extend our previous studies in two different ways. First, we replace the previously used random linear fountain code by a more sophisticated raptor code, namely the R10 code. Second, we investigate a scenario, where the rateless coding scheme, which typically does not need any feedback, has acknowledgement information available. Both proposals show significant benefits of up to 15 % compared with our previous work in our mathematical analysis and empirical simulations.