Subspace-Aware Index Codes

Bhavya Kailkhura, Lakshmi Narasimhan Theagarajan, Pramod Kumar Varshney

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

In this letter, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications (e.g., multimedia), the data to be transmitted may lie (or can be well approximated) in a low-dimensional subspace. We exploit this low-dimensional structure of the data using an algebraic framework to solve the index coding problem (referred to as subspace-aware index coding) as opposed to the traditional index coding problem which is subspace-unaware. Also, we propose an efficient algorithm based on the alternating minimization approach to obtain near optimal index codes for both subspace-aware and -unaware cases. Our simulations indicate that under certain conditions, a significant throughput gain (about 90%) can be achieved by subspace-aware index codes over conventional subspace-unaware index codes.

Original languageEnglish (US)
Article number7898367
Pages (from-to)366-369
Number of pages4
JournalIEEE Wireless Communications Letters
Volume6
Issue number3
DOIs
StatePublished - Jun 1 2017

Keywords

  • alternating minimization
  • coded side-information
  • Index coding
  • low-dimensional data

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Physics and Astronomy (miscellaneous)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Subspace-Aware Index Codes'. Together they form a unique fingerprint.

  • Cite this