{'fraction_non_alphanumeric': 0.013254786450662739, 'fraction_numerical': 0.0, 'mean_word_length': 5.071428571428571, '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}}
Multi-Sender Index Coding Over Linear Networks

We consider an index coding problem in which several transmitters deliver distinct files to a number of users with minimum delay. Each user has access to a subset of other files from the library, which can be used as side information. The information sent by the transmitters experience a linear transformation before being received at the users. By benefiting from the concept of Zero-Forcing in MIMO systems, we generalize the notion of MinRank characterization and the clique cover algorithm to accommodate this generalized setting. We show that increasing the number of transmitters can substantially reduce the delivery delay.