TY - GEN
T1 - Finding sparse solutions for the index coding problem
AU - Chaudhry, M. A.R.
AU - Asad, Z.
AU - Sprintson, A.
AU - Langberg, M.
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - The Index Coding problem has recently attracted a significant attention from the research community. In this problem, a server needs to deliver data to a set of wireless clients over the broadcast channel. Each client requires one or more packets, but it might have access to the packets requested by other clients as side information. The goal is to deliver the required data to each client with minimum number of transmissions. In this paper, we focus on finding sparse solutions to the Index Coding problem. In a sparse solution each transmitted packet is a linear combination of at most two original packets. We focus both on scalar and vector versions of the problem. For the scalar case, we present a polynomial time algorithm that achieves an approximation ratio of 2 - 1/√n. For the vector case, we present a polynomial time algorithm that identifies an optimal solution to the problem. Our simulation studies demonstrate that our algorithms achieve good performance in practical scenarios.
AB - The Index Coding problem has recently attracted a significant attention from the research community. In this problem, a server needs to deliver data to a set of wireless clients over the broadcast channel. Each client requires one or more packets, but it might have access to the packets requested by other clients as side information. The goal is to deliver the required data to each client with minimum number of transmissions. In this paper, we focus on finding sparse solutions to the Index Coding problem. In a sparse solution each transmitted packet is a linear combination of at most two original packets. We focus both on scalar and vector versions of the problem. For the scalar case, we present a polynomial time algorithm that achieves an approximation ratio of 2 - 1/√n. For the vector case, we present a polynomial time algorithm that identifies an optimal solution to the problem. Our simulation studies demonstrate that our algorithms achieve good performance in practical scenarios.
UR - http://www.scopus.com/inward/record.url?scp=84857210253&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2011.6134497
DO - 10.1109/GLOCOM.2011.6134497
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84857210253
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -