Index coding - An interference alignment perspective

Hamed Maleki, Viveck Ramesh Cadambe, Syed A. Jafar

Research output: Contribution to journalArticle

69 Citations (Scopus)

Abstract

The index coding problem is studied from an interference alignment perspective providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between the capacity of multiple unicast index coding (where each message is desired by exactly one receiver), and groupcast index coding (where a message can be desired by multiple receivers), which settles the heretofore open question of insufficiency of linear codes for the multiple unicast index coding problem by equivalence with groupcast settings, where this question has previously been answered. Necessary and sufficient conditions for the achievability of rate half per message in the index coding problem are shown to be a natural consequence of interference alignment constraints, and generalizations to feasibility of rate 1/(L+1)per message when each destination desires at least L messages, are similarly obtained. Finally, capacity optimal solutions are presented to a series of symmetric index coding problems inspired by the local connectivity and local interference characteristics of wireless networks. The solutions are based on vector linear coding.

Original languageEnglish (US)
Article number6855359
Pages (from-to)5402-5432
Number of pages31
JournalIEEE Transactions on Information Theory
Volume60
Issue number9
DOIs
StatePublished - Jan 1 2014

Fingerprint

coding
interference
Wireless networks
equivalence
recipient

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Maleki, Hamed ; Cadambe, Viveck Ramesh ; Jafar, Syed A. / Index coding - An interference alignment perspective. In: IEEE Transactions on Information Theory. 2014 ; Vol. 60, No. 9. pp. 5402-5432.
@article{27fa1ea54ac84c5cb68862e0fb0eb65d,
title = "Index coding - An interference alignment perspective",
abstract = "The index coding problem is studied from an interference alignment perspective providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between the capacity of multiple unicast index coding (where each message is desired by exactly one receiver), and groupcast index coding (where a message can be desired by multiple receivers), which settles the heretofore open question of insufficiency of linear codes for the multiple unicast index coding problem by equivalence with groupcast settings, where this question has previously been answered. Necessary and sufficient conditions for the achievability of rate half per message in the index coding problem are shown to be a natural consequence of interference alignment constraints, and generalizations to feasibility of rate 1/(L+1)per message when each destination desires at least L messages, are similarly obtained. Finally, capacity optimal solutions are presented to a series of symmetric index coding problems inspired by the local connectivity and local interference characteristics of wireless networks. The solutions are based on vector linear coding.",
author = "Hamed Maleki and Cadambe, {Viveck Ramesh} and Jafar, {Syed A.}",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/TIT.2014.2338865",
language = "English (US)",
volume = "60",
pages = "5402--5432",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

Index coding - An interference alignment perspective. / Maleki, Hamed; Cadambe, Viveck Ramesh; Jafar, Syed A.

In: IEEE Transactions on Information Theory, Vol. 60, No. 9, 6855359, 01.01.2014, p. 5402-5432.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Index coding - An interference alignment perspective

AU - Maleki, Hamed

AU - Cadambe, Viveck Ramesh

AU - Jafar, Syed A.

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The index coding problem is studied from an interference alignment perspective providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between the capacity of multiple unicast index coding (where each message is desired by exactly one receiver), and groupcast index coding (where a message can be desired by multiple receivers), which settles the heretofore open question of insufficiency of linear codes for the multiple unicast index coding problem by equivalence with groupcast settings, where this question has previously been answered. Necessary and sufficient conditions for the achievability of rate half per message in the index coding problem are shown to be a natural consequence of interference alignment constraints, and generalizations to feasibility of rate 1/(L+1)per message when each destination desires at least L messages, are similarly obtained. Finally, capacity optimal solutions are presented to a series of symmetric index coding problems inspired by the local connectivity and local interference characteristics of wireless networks. The solutions are based on vector linear coding.

AB - The index coding problem is studied from an interference alignment perspective providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between the capacity of multiple unicast index coding (where each message is desired by exactly one receiver), and groupcast index coding (where a message can be desired by multiple receivers), which settles the heretofore open question of insufficiency of linear codes for the multiple unicast index coding problem by equivalence with groupcast settings, where this question has previously been answered. Necessary and sufficient conditions for the achievability of rate half per message in the index coding problem are shown to be a natural consequence of interference alignment constraints, and generalizations to feasibility of rate 1/(L+1)per message when each destination desires at least L messages, are similarly obtained. Finally, capacity optimal solutions are presented to a series of symmetric index coding problems inspired by the local connectivity and local interference characteristics of wireless networks. The solutions are based on vector linear coding.

UR - http://www.scopus.com/inward/record.url?scp=84906678531&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906678531&partnerID=8YFLogxK

U2 - 10.1109/TIT.2014.2338865

DO - 10.1109/TIT.2014.2338865

M3 - Article

AN - SCOPUS:84906678531

VL - 60

SP - 5402

EP - 5432

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

M1 - 6855359

ER -