Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Subspace-Aware Index Codes   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.

19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
25
The categories of this paper are: patt-sol
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
23
The categories of this paper are: solv-int
33
The categories of this paper are: plasm-ph