Conference Paper

Index Coding with Side Information

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa
DOI: 10.1109/FOCS.2006.42 Conference: 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

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define $r$-solvable networks, in which data dissemination can be achieved in $r > 0$ communications rounds. We show that the optimum number of transmissions for any one-round communications scheme is given by the minimum rank of a certain constrained family of matrices. For general $r$-solvable networks, we derive an upper bound on the minimum number of transmissions in any scheme with $\geq r$ rounds. We experimentally compare the obtained upper bound to a simple lower bound.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We study the index coding problem in the unicast message setting, i.e., where each message is requested by one unique receiver. This problem can be modeled by a directed graph. We propose a new scheme called interlinked cycle cover, which exploits interlinked cycles in the directed graph, for designing index codes. This new scheme generalizes the existing clique cover and cycle cover schemes. We prove that for a class of infinitely many digraphs with messages of any length, interlinked cycle cover provides an optimal index code. Furthermore, the index code is linear with linear time encoding complexity.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In the present paper, we propose a broadcast ARQ protocol based on the concept of index coding. In the proposed scenario, a server wishes to transmit a finite sequence of packets to multiple receivers via a broadcast channel with packet erasures until all of the receivers successfully receive all of the packets. In the retransmission phase, the server produces a coded packet as a retransmitted packet based on the side-information sent from the receivers via feedback channels. A notable feature of the proposed protocol is that the decoding process at the receiver side has low decoding complexity because only a small number of addition operations are needed in order to recover an intended packet. This feature may be preferable for reducing the power consumption of receivers. The throughput performance of the proposed protocol is close to that of the ideal FEC throughput performance when the erasure probability is less than $0.1$. This implies that the proposed protocol provides almost optimal throughput performance in such a regime.

Preview (2 Sources)

1 Download
Available from