On the Capacity Region for Index Coding
Authors:
- Bernd BandemerBBBernd Bandemer
- Eren SasogluESEren Sasoglu
Preprint
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).Keywords
All Related Versions
- Version 1, 2013-02-06, ArXiv
- Version 2, 2013-06-15, ArXiv
- Published version: .
This publication has 12 references indexed in Scilit:
- Index Coding Capacity: How Far Can One Go With Only Shannon Inequalities?IEEE Transactions on Information Theory, 2015
- An Equivalence Between Network Coding and Index CodingIEEE Transactions on Information Theory, 2015
- Local graph coloring and index coding2013
- Network Information Theory2011
- Lexicographic Products and the Power of Non-linear Network Coding2011
- On the Index Coding Problem and Its Relation to Network Coding and Matroid TheoryIEEE Transactions on Information Theory, 2010
- Interference Alignment and Degrees of Freedom of the $K$-User Interference ChannelIEEE Transactions on Information Theory, 2008
- Network information flowIEEE Transactions on Information Theory, 2000
- The capacity region of general multiple-access channel with certain correlated sourcesInformation and Control, 1979
- Large scale methods to enumerate extreme rays and elementary modes