Bipartite Index Coding

The authors analyze a generalized index coding problem that allows multiple users to request the same packet. For this problem they introduce a novel coding scheme called partition multicast. Their scheme can be seen as a natural generalization of clique cover for directed index coding problems. Further, partition multicast corresponds to an achievable scheme for the generalized bipartite index coding problem that they introduce in this paper. Their scheme partitions the nodes into groups and solves a multicasting problem within each group.

Provided by: University of Southern California Topic: Mobility Date Added: May 2012 Format: PDF

Find By Topic