Optimal Linear Broadcast Rates of the Two-Sender Unicast Index Coding Problem with Fully-Participated Interactions

The two-sender unicast index coding problem consists of finding optimal coded transmissions from the two senders which collectively know the messages demanded by all the receivers. Each receiver demands a unique message. One important class of this problem consists of the message sets at the senders and the side-information at the receivers satisfying \emph{fully-participated interactions}. This paper provides optimal linear broadcast rates and corresponding code constructions for all the possible cases of the two-sender unicast index coding problem with fully-participated interactions. The optimal linear broadcast rate and the corresponding code for the two-sender problem are given in terms of those of the three single-sender unicast problems associated with the two-sender problem. Optimal linear broadcast rates of two-sender problems with fully-participated interactions provide lower bounds for the optimal linear broadcast rates of many related two-sender problems with \emph{partially-participated interactions}. Proof techniques used to obtain the results for the two-sender problem are shown to be useful in obtaining the results for some cases of the multi-sender unicast index coding problem.

[1]  Lawrence Ong,et al.  Graph-Theoretic Approaches to Two-Sender Index Coding , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[2]  D. West.  Introduction to Graph Theory , 1995 .

[3]  B. Sundar Rajan,et al.  Optimal Scalar Linear Codes for Some Classes of The Two-Sender Groupcast Index Coding Problem , 2018 .

[4]  B. Sundar Rajan,et al.  Optimal Scalar Linear Index Codes for Three Classes of Two-Sender Unicast Index Coding Problem , 2018, ArXiv.

[5]  Yucheng Liu,et al.  On the capacity for distributed index coding , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[6]  Lawrence Ong,et al.  Structural Characteristics of Two-Sender Index Coding , 2019, Entropy.

[7]  Alexandros G. Dimakis,et al.  FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers , 2013, IEEE Transactions on Information Theory.

[8]  Vaneet Aggarwal,et al.  Coded Caching With Distributed Storage , 2019, IEEE Transactions on Information Theory.

[9]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[10]  Lawrence Ong,et al.  Cooperative Multi-Sender Index Coding , 2019, IEEE Transactions on Information Theory.

[11]  Lawrence Ong,et al.  Improved bounds for multi-sender index coding , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[12]  Amin Gohari,et al.  Critical Graphs in Index Coding , 2013, IEEE Journal on Selected Areas in Communications.

[13]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[14]  Lawrence Ong,et al.  The Single-Uniprior Index-Coding Problem: The Single-Sender Case and the Multi-Sender Extension , 2016, IEEE Transactions on Information Theory.

[15]  Syed A. Jafar,et al.  Interference Alignment: A New Look at Signal Dimensions in a Communication Network , 2011, Found. Trends Commun. Inf. Theory.

[16]  Parastoo Sadeghi,et al.  Distributed index coding , 2016, 2016 IEEE Information Theory Workshop (ITW).