On the capacity region for index coding
Authors:
- Fatemeh ArbabjolfaeiFAFatemeh Arbabjolfaei
- Bernd BandemerBBBernd Bandemer
- Young-Han KimYKYoung-Han Kim
- Eren SasogluESEren Sasoglu
- Lele WangLWLele Wang
- 1 July 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound is built on a random coding scheme and optimal decoding, and has a simple polymatroidal single-letter expression. The utility of the inner bound is demonstrated by examples that include the capacity region for all index coding problems with up to five messages (there are 9846 nonisomorphic ones).Comment: 5 pages, 6 figures, accepted to the 2013 IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey, July 201Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Local graph coloring and index coding2013
- On linear index coding for random graphs2012
- Index coding: An interference alignment perspective2012
- Network Information Theory2011
- Network coding: Is zero error always possible?2011
- Index coding with outerplanar side information2011
- Interference Alignment and Degrees of Freedom of the $K$-User Interference ChannelIEEE Transactions on Information Theory, 2008
- Informed-source coding-on-demand (ISCOD) over broadcast channels2002
- Network information flowIEEE Transactions on Information Theory, 2000
- The capacity region of general multiple-access channel with certain correlated sourcesInformation and Control, 1979