Groupcast Index Coding Problem: Joint Extensions

The groupcast index coding problem is the most general version of the classical index coding problem, where any receiver can demand messages that are also demanded by other receivers. Any groupcast index coding problem is described by its \emph{fitting matrix} which contains unknown entries along with $1$'s and $0$'s. The problem of finding an optimal scalar linear code is equivalent to completing this matrix with known entries such that the rank of the resulting matrix is minimized. Any row basis of such a completion gives an optimal \emph{scalar linear} code. An index coding problem is said to be a joint extension of a finite number of index coding problems, if the fitting matrices of these problems are disjoint submatrices of the fitting matrix of the jointly extended problem. In this paper, a class of joint extensions of any finite number of groupcast index coding problems is identified, where the relation between the fitting matrices of the sub-problems present in the fitting matrix of the jointly extended problem is defined by a base problem. A lower bound on the \emph{minrank} (optimal scalar linear codelength) of the jointly extended problem is given in terms of those of the sub-problems. This lower bound also has a dependence on the base problem and is operationally useful in finding lower bounds of the jointly extended problems when the minranks of all the sub-problems are known. We provide an algorithm to construct scalar linear codes (not optimal in general), for any groupcast problem belonging to the class of jointly extended problems identified in this paper. The algorithm uses scalar linear codes of all the sub-problems and the base problem. We also identify some subclasses, where the constructed codes are scalar linear optimal.

[1]  Stanislav Jabuka Rational Witt classes of pretzel knots , 2008, 0806.3245.

[2]  Yeow Meng Chee,et al.  On the Security of Index Coding With Side Information , 2011, IEEE Transactions on Information Theory.

[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]  Youngchul Sung,et al.  Some new results on index coding when the number of data is less than the number of receivers , 2014, 2014 IEEE International Symposium on Information Theory.

[6]  Lakshmi Natarajan,et al.  Linear Codes for Broadcasting With Noisy Side Information , 2019, IEEE Transactions on Information Theory.

[7]  Prasad Krishnan,et al.  Index Coding: Rank-Invariant Extensions , 2018, 2018 Twenty Fourth National Conference on Communications (NCC).

[8]  B. Sundar Rajan,et al.  Optimal vector linear index codes for some symmetric side information problems , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[9]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

[10]  B. Sundar Rajan,et al.  Low-Complexity Decoding for Symmetric, Neighboring and Consecutive Side-information Index Coding Problems , 2017, ArXiv.

[11]  Mahdi Jafari Siavoshani,et al.  On linear index coding from graph homomorphism perspective , 2015, 2015 Information Theory and Applications Workshop (ITA).

[12]  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.

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

[14]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2006, IEEE Transactions on Information Theory.

[15]  Noga Alon,et al.  Broadcasting with Side Information , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[16]  B. Sundar Rajan,et al.  A Lifting Construction for Scalar Linear Index Codes , 2015, ArXiv.

[17]  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.

[18]  Uri Stav,et al.  Non-Linear Index Coding Outperforming the Linear Optimum , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[19]  Zhen Zhang,et al.  Dynamic Index Coding for Wireless Broadcast Networks , 2013, IEEE Transactions on Information Theory.

[20]  Yeow Meng Chee,et al.  Optimal index codes with near-extreme rates , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[21]  Young-Han Kim,et al.  Generalized Lexicographic Products and the Index Coding Capacity , 2020, IEEE Transactions on Information Theory.