{'fraction_non_alphanumeric': 0.023023023023023025, 'fraction_numerical': 0.004004004004004004, 'mean_word_length': 5.211180124223603, '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}}
Embedded MDS codes for multicast streaming

We study low-delay streaming codes for erasure channels in point-to-point and multicast scenarios. We consider a sliding window erasure channel which captures the temporal correlation in packet losses observed in real channels. This correlation is often modelled using statistical channels such as Gilbert-Elliott channel. In the point-to-point case, we provide a new class of codes, Embedded Maximum Distance Separable (EMDS) codes, which recovers from channels introducing a mixture of burst and isolated erasures. Moreover, we propose a technique that extends point-to-point codes for the multicast scenario with two receivers that tolerate different delays, T1 and T2. The multicast codes opportunistically decode packets with short delay T1 when the channel is relatively better and with long delay T2 when the channel is worse. Simulations over multicast Gilbert-Elliott channels show that EMDS codes outperform other streaming codes for both users.