Conference Paper

Index Coding with Side Information

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa
DOI: 10.1109/FOCS.2006.42 In proceeding of: Foundations of Computer Science, 2006. FOCS '06. 47th Annual IEEE Symposium on
Source: IEEE Xplore

ABSTRACT Motivated by a problem of transmitting data over broadcast channels (BirkandKol, INFOCOM1998), we study the following coding problem: a sender communicates with n receivers Rl,.., Rn. He holds an input x isin {0, 1}n and wishes to broadcast a single message so that each receiver Ri can recover the bit xi. Each Ri has prior side information about x, induced by a directed graph G on n nodes; Ri knows the bits of x in the positions {j | (i, j) is anedge of G}. We call encoding schemes that achieve this goal INDEX codes for {0, 1} n with side information graph G. In this paper we identify a measure on graphs, the minrank, which we conjecture to exactly characterize the minimum length of INDEX codes. We resolve the conjecture for certain natural classes of graphs. For arbitrary graphs, we show that the minrank bound is tight for both linear codes and certain classes of non-linear codes. For the general problem, we obtain a (weaker) lower bound that the length of an INDEX code for any graph G is at least the size of the maximum acyclic induced subgraph of G

  • [Show abstract] [Hide abstract]
    ABSTRACT: Solving WPRTPs (wireless packet retransmission problems) using NC (network coding) is increasingly attracting research efforts. However, no work on NC based schemes for WPRTPs in MCNs (multiple channel networks) has been found. In this paper, RNC (random network coding) based schemes for P-WPRTPs (perfect WPRTPs) in MCNs, denoted as MC-P-WPRTPs (multiple channel perfect WPRTPs), are studied by transforming MC-P-WPRTPs into ILP (integer linear programming) problems. The ILP problems corresponding to MC-P-WPRTPs with four typical configurations are derived. Then the corresponding packet retransmission schedule schemes for MC-P-WPRTPs are proposed based on the solutions to the ILP problems and random network coding. To solve the ILP problems efficiently, an algorithm named as progressively fixing algorithm is proposed which recursively reduce the size of the ILP problem by fixing some of the variables according to some criteria. The criteria are related to the solution to the LP problem obtained by relaxing the integral constraints on the variables in the original ILP problem. Simulation results show that the NC based schemes for MC-P-WPRTPs are effective in saving packet retransmissions. In some situations, NC based schemes can save about 50 % packet retransmissions.
    Wireless Personal Communications 04/2013; 69(4). · 0.43 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef et al., FOCS, 2006). We show a polynomial time algorithm that, given an n vertex graph G with minrank k, finds a linear index code for G of length $\widetilde{O}(n^{f(k)})$, where f(k) depends only on k. For example, for k=3 we obtain f(3) ~ 0.2574. Our algorithm employs a semidefinite program (SDP) introduced by Karger, Motwani and Sudan (J. ACM, 1998) for graph coloring and its refined analysis due to Arora, Chlamtac and Charikar (STOC, 2006). Since the SDP we use is not a relaxation of the minimization problem we consider, a crucial component of our analysis is an upper bound on the objective value of the SDP in terms of the minrank. At the heart of our analysis lies a combinatorial result which may be of independent interest. Namely, we show an exact expression for the maximum possible value of the Lovasz theta-function of a graph with minrank k. This yields a tight gap between two classical upper bounds on the Shannon capacity of a graph.
  • Conference Paper: H-wise independence
    [Show abstract] [Hide abstract]
    ABSTRACT: For a hypergraph H on the vertex set {1,...,n}, a distribution D = (D_1,...,D_n) over {0,1}^n is H-wise independent if every restriction of D to indices which form an edge in H is uniform. This generalizes the notion of k-wise independence obtained by taking H to be the complete n vertex k-uniform hypergraph. This generalization was studied by Schulman (STOC 1992), who presented constructions of H-wise independent distributions that are linear, i.e., the samples are strings of inner products (over F2) of a fixed set of vectors with a uniformly chosen random vector. Let l(H) denote the minimum possible size of a sample space of a uniform H-wise independent distribution. The l parameter is well understood for the special case of k-wise independence. In this work we study the notion of H-wise independence and the l parameter for general graphs and hypergraphs. For graphs, we show how the l parameter relates to standard graph parameters (e.g., clique number, chromatic number, Lovasz theta function, minrank). We derive algorithmic and hardness results for this parameter as well as an explicit construction of graphs G for which l(G) is exponentially smaller than the size of the sample space of any linear G-wise independent distribution. For hypergraphs, we study the problem of testing whether a given distribution is H-wise independent, generalizing results of Alon et al. (STOC 2007).
    Proceedings of the 4th conference on Innovations in Theoretical Computer Science; 01/2013

Full-text (2 Sources)

Available from