A New Upperbound on the Broadcast Rate and Near-Optimal Vector Linear Codes for Index Coding Problems with Symmetric Neighboring Interference

Vaddi, Mahesh Babu and Rajan, B Sundar (2018) A New Upperbound on the Broadcast Rate and Near-Optimal Vector Linear Codes for Index Coding Problems with Symmetric Neighboring Interference. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 601-605.

PDF ISIT_601_2018.pdf - Published Version Restricted to Registered users only Download (272kB) | 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 K-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), x(k+2), ... , x(k+D)} is the interference with D messages after and U messages before its desired message. The single unicast index coding problem with symmetric neighboring interference (SUICP-SNI) is motivated by topological interference management problems in wireless communication networks. Maleki, Cadambe and Jafar obtained the capacity of this SUICP-SNI with K tending to infinity and Blasiak, Kleinberg and Lubetzky for the special case of (D = U = 1) with K being finite. Finding the capacity of the SUICP-SNI for arbitrary K, D and U is a challenging open problem. In this paper, for an SUICP-SNI with arbitrary K, D and U, we define a set S of 2-tuples such that for every (a, b) in that set S, the rate D + 1 + a/b is achieved by using vector linear index codes over every finite field. We give an algorithm to find the values of a and b such that (a, b) is an element of S and a/b is minimum. We present a new upperbound on the broadcast rate of SUICP-SNI and prove that this upperbound coincides with the existing results on the exact value of the capacity of SUICP-SNI in the respective settings.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belong to IEEE
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	22 Nov 2018 15:03
Last Modified:	22 Nov 2018 15:03
URI:	http://eprints.iisc.ac.in/id/eprint/61129

Actions (login required)

View Item