Subspace-Aware Index Codes
Abstract
In this paper, we generalize the well-known index coding problem to exploit the structure in the source-data to improve system throughput. In many applications, 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.
Keywords
Cite
@article{arxiv.1702.03589,
title = {Subspace-Aware Index Codes},
author = {Bhavya Kailkhura and Lakshmi Narasimhan Theagarajan and Pramod K. Varshney},
journal= {arXiv preprint arXiv:1702.03589},
year = {2017}
}