DocumentCode
640032
Title
On the capacity region for index coding
Author
Arbabjolfaei, Fatemeh ; Bandemer, Bernd ; Young-Han Kim ; Sasoglu, Eren ; Lele Wang
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of California, San Diego, La Jolla, CA, USA
fYear
2013
fDate
7-12 July 2013
Firstpage
962
Lastpage
966
Abstract
A new inner bound on the capacity region of the general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound relies 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
decoding; graph theory; random codes; algebraic tool; capacity region; general index coding problem; graph theory; inner bound; optimal decoding; random coding scheme; simple polymatroidal single-letter expression; Channel coding; Decoding; Indexes; Network coding; Receivers;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location
Istanbul
ISSN
2157-8095
Type
conf
DOI
10.1109/ISIT.2013.6620369
Filename
6620369
Link To Document