{'fraction_non_alphanumeric': 0.019099590723055934, 'fraction_numerical': 0.0, 'mean_word_length': 5.220338983050848, '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}}
Finite block length coding for low-latency high-reliability wireless communication

This paper takes a step towards making practical cooperative protocols for wireless low-latency high-reliability communication. We consider the effect of finite block-length error correction codes and the main message is that the demands on the error-correcting code are different in different phases of a diversity-seeking cooperative protocol: In the first hop where messages must reach potential relays, the code only has to achieve a moderate probability of error. The final hop from relays to the destination is where the code must be ultrareliable. The results are illustrated in the context of a simple concatenated Hamming+Reed Solomon code.