TY - GEN
T1 - Distributed index coding
AU - Sadeghi, Parastoo
AU - Arbabjolfaei, Fatemeh
AU - Kim, Young Han
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/10/21
Y1 - 2016/10/21
N2 - In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all n messages requested by the receivers, in the distributed index coding there are 2n-1 servers, each containing a unique non-empty subset J of the messages and each is connected to all receivers via a noiseless independent broadcast link with an arbitrary capacity CJ ≥ 0. First, we generalize the existing outer bound on the capacity region of the centralized problem to the distributed case. Next, building upon the existing centralized composite coding scheme, we propose three distributed composite coding schemes and derive the corresponding inner bounds on the capacity region. We present a number of interesting numerical examples, which highlight the subtleties and challenges of dealing with the distributed index coding, even for very small problem sizes of n = 3 and n = 4.
AB - In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all n messages requested by the receivers, in the distributed index coding there are 2n-1 servers, each containing a unique non-empty subset J of the messages and each is connected to all receivers via a noiseless independent broadcast link with an arbitrary capacity CJ ≥ 0. First, we generalize the existing outer bound on the capacity region of the centralized problem to the distributed case. Next, building upon the existing centralized composite coding scheme, we propose three distributed composite coding schemes and derive the corresponding inner bounds on the capacity region. We present a number of interesting numerical examples, which highlight the subtleties and challenges of dealing with the distributed index coding, even for very small problem sizes of n = 3 and n = 4.
UR - http://www.scopus.com/inward/record.url?scp=84999018457&partnerID=8YFLogxK
U2 - 10.1109/ITW.2016.7606850
DO - 10.1109/ITW.2016.7606850
M3 - Conference contribution
T3 - 2016 IEEE Information Theory Workshop, ITW 2016
SP - 330
EP - 334
BT - 2016 IEEE Information Theory Workshop, ITW 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE Information Theory Workshop, ITW 2016
Y2 - 11 September 2016 through 14 September 2016
ER -