On the Capacity of Index Coding Problems with Symmetric Neighboring Interference

Vaddi, Mahesh Babu and Rajan, B Sundar (2017) On the Capacity of Index Coding Problems with Symmetric Neighboring Interference. In: 2017 IEEE Information Theory Workshop (ITW), NOV 06-10, 2017, Kaohsiung, TAIWAN, pp. 294-298.

PDF itw_294_2017.pdf - Published Version Restricted to Registered users only Download (162kB) | Request a copy

Abstract

A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equal number of K messages and K receivers, the kth receiver R-k wanting the kth message x(k) and having the side-information kappa(k) = (I-k boolean OR x(k))(c), where I-k = {x(k-U),..., x(k-2), x(k-1)} boolean OR {x(k+1), z(k+2),.., x(k+D)} is the interference with D messages after and U messages before its desired message. Maleki, Cadambe and Jafar obtained the capacity of this symmetric neighboring interference single unicast index coding problem (SNI-SUICP) with (K) tending to infinity and Blasiak, Kleinberg and Lubetzky for the special case of (D = U = 1) with K being finite. In this work, for any finite K and arbitrary D we obtain the capacity for the case U = gcd(K, D + 1) - 1. Our achievability proof is constructive, i.e., we give an explicit construction of a linear index code achieving the capacity.

Item Type:	Conference Proceedings
Series.:	Information Theory Workshop
Publisher:	IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Additional Information:	Copy right for the article belong to IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	27 Mar 2018 18:26
Last Modified:	27 Mar 2018 18:26
URI:	http://eprints.iisc.ac.in/id/eprint/59409

Actions (login required)

View Item