DocumentCode :
110597
Title :
An Equivalence Between Network Coding and Index Coding
Author :
Effros, Michelle ; El Rouayheb, Salim ; Langberg, Michael
Author_Institution :
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
Volume :
61
Issue :
5
fYear :
2015
fDate :
May-15
Firstpage :
2478
Lastpage :
2487
Abstract :
We show that the network coding and index coding problems are equivalent. This equivalence holds in the general setting which includes linear and nonlinear codes. Specifically, we present a reduction that maps a network coding instance to an index coding instance while preserving feasibility, i.e., the network coding instance has a feasible solution if and only if the corresponding index coding instance is feasible. In addition, we show that one can determine the capacity region of a given network coding instance with colocated sources by studying the capacity region of a corresponding index coding instance. Previous connections between network and index coding were restricted to the linear case.
Keywords :
network coding; index coding problems; network coding problems; Decoding; Encoding; Indexes; Network coding; Random variables; Vectors; Xenon; Communication networks; network coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2015.2414926
Filename :
7064720
Link To Document :
بازگشت