.png){kind=icon}
.png){kind=icon}
Return
Multi-Sender Index Coding Over Linear Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2021.3132988.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Indexes
Encoding
Transmitters
Codes
Wireless communication
Delays
Libraries
Index coding
multiple servers
MISO broadcast
generalized MinRank
generalized clique cover
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W