Multi-Sender Index Coding Over Linear Networks
- 6 December 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 26 (2) , 273-276
Abstract
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
This publication has 17 references indexed in Scilit:
- Multi-Sender Index Coding for Collaborative Broadcasting: A Rank-Minimization ApproachIEEE Transactions on Communications, 2018
- Multi-Server Coded CachingIEEE Transactions on Information Theory, 2016
- The Single-Uniprior Index-Coding Problem: The Single-Sender Case and the Multi-Sender ExtensionIEEE Transactions on Information Theory, 2016
- Subspace Properties of Network Coding and Their ApplicationsIEEE Transactions on Information Theory, 2012
- Compute-and-Forward: Harnessing Interference Through Structured CodesIEEE Transactions on Information Theory, 2011
- Index Coding With Side InformationIEEE Transactions on Information Theory, 2011
- Efficient algorithms for Index Coding2008
- A Random Linear Network Coding Approach to MulticastIEEE Transactions on Information Theory, 2006
- Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clientsIEEE Transactions on Information Theory, 2006
- Informed-source coding-on-demand (ISCOD) over broadcast channels2002