On the complementary Index Coding problem

M. A.R. Chaudhry, Z. Asad, A. Sprintson, M. Langberg

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים


The Index Coding problem is one of the basic problems in wireless network coding. In this problem, a server needs to deliver a set P of packets to several clients through a noiseless broadcast channel. Each client needs to obtain a certain subset of P and has prior side information about a different subset of P. The objective is to satisfy the requirements of all clients with the minimum number of transmissions. Recently, it was shown that the Index Coding problem is NP-hard. Furthermore, this problem was shown to be hard to approximate under a widely accepted complexity assumption. In this paper, we consider a complementary problem whose goal is to maximize the number of saved transmissions, i.e., the number of transmissions that are saved by combining packets compared to the solution that does not involve coding. We refer to this problem as the the Complementary Index Coding problem. It turns out that the complementary problem can be approximated in certain cases of practical importance. We consider the multiple unicast and multiple multicast scenarios. In the multiple unicast scenario, each packet is requested by a single client; while in the multiple multicast scenario, each packet can be requested by several clients. For the multiple unicast scenario, we present approximation algorithms for finding scalar and vector linear solutions. For the multiple multicast scenario, we show that finding an approximation solution is NP-hard.

שפה מקוריתאנגלית
כותר פרסום המארח2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
מספר עמודים5
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2011
אירוע2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, רוסיה
משך הזמן: 31 יולי 20115 אוג׳ 2011

סדרות פרסומים

שםIEEE International Symposium on Information Theory - Proceedings
ISSN (מודפס)2157-8104


כנס2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
עירSt. Petersburg

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'On the complementary Index Coding problem'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי