pith. sign in

arxiv: 1504.06761 · v1 · pith:FSUA4SBJnew · submitted 2015-04-25 · 💻 cs.IT · math.IT

Structural Properties of Index Coding Capacity Using Fractional Graph Theory

classification 💻 cs.IT math.IT
keywords capacitycodingindexregionfractionalgraphproblemproperties
0
0 comments X
read the original abstract

The capacity region of the index coding problem is characterized through the notion of confusion graph and its fractional chromatic number. Based on this multiletter characterization, several structural properties of the capacity region are established, some of which are already noted by Tahmasbi, Shahrasbi, and Gohari, but proved here with simple and more direct graph-theoretic arguments. In particular, the capacity region of a given index coding problem is shown to be simple functionals of the capacity regions of smaller subproblems when the interaction between the subproblems is none, one-way, or complete.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.