31,753 research outputs found
Reduced Dimensional Optimal Vector Linear Index Codes for Index Coding Problems with Symmetric Neighboring and Consecutive Side-information
A single unicast index coding problem (SUICP) with symmetric neighboring and
consecutive side-information (SNCS) has messages and receivers, the
th receiver wanting the th message and having the
side-information . The single unicast index coding problem with
symmetric neighboring and consecutive side-information, SUICP(SNCS), is
motivated by topological interference management problems in wireless
communication networks. Maleki, Cadambe and Jafar obtained the symmetric
capacity of this SUICP(SNCS) and proposed optimal length codes by using
Vandermonde matrices. In our earlier work, we gave optimal length
-dimensional vector linear index codes for SUICP(SNCS) satisfying some
conditions on and \cite{VaR1}. In this paper, for SUICP(SNCS) with
arbitrary and , we construct optimal length
-dimensional vector linear index codes. We
prove that the constructed vector linear index code is of minimal dimension if
is equal to . The proposed
construction gives optimal length scalar linear index codes for the SUICP(SNCS)
if divides both and . The proposed construction is independent
of field size and works over every field. We give a low-complexity decoding for
the SUICP(SNCS). By using the proposed decoding method, every receiver is able
to decode its wanted message symbol by simply adding some index code symbols
(broadcast symbols).Comment: 13 pages, 1 figure and 5 table
Optimal Error Correcting Delivery Scheme for Coded Caching with Symmetric Batch Prefetching
Coded caching is used to reduce network congestion during peak hours. A
single server is connected to a set of users through a bottleneck link, which
generally is assumed to be error-free. During non-peak hours, all the users
have full access to the files and they fill their local cache with portions of
the files available. During delivery phase, each user requests a file and the
server delivers coded transmissions to meet the demands taking into
consideration their cache contents. In this paper we assume that the shared
link is error prone. A new delivery scheme is required to meet the demands of
each user even after receiving finite number of transmissions in error. We
characterize the minimum average rate and minimum peak rate for this problem.
We find closed form expressions of these rates for a particular caching scheme
namely \textit{symmetric batch prefetching}. We also propose an optimal error
correcting delivery scheme for coded caching problem with symmetric batch
prefetching.Comment: 9 pages and 4 figure
On Approximating the Sum-Rate for Multiple-Unicasts
We study upper bounds on the sum-rate of multiple-unicasts. We approximate
the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts
network coding problem with independent sources. Our approximation
algorithm runs in polynomial time and yields an upper bound on the joint source
entropy rate, which is within an factor from the GNS cut. It
further yields a vector-linear network code that achieves joint source entropy
rate within an factor from the GNS cut, but \emph{not} with
independent sources: the code induces a correlation pattern among the sources.
Our second contribution is establishing a separation result for vector-linear
network codes: for any given field there exist networks for which
the optimum sum-rate supported by vector-linear codes over for
independent sources can be multiplicatively separated by a factor of
, for any constant , from the optimum joint entropy
rate supported by a code that allows correlation between sources. Finally, we
establish a similar separation result for the asymmetric optimum vector-linear
sum-rates achieved over two distinct fields and
for independent sources, revealing that the choice of field
can heavily impact the performance of a linear network code.Comment: 10 pages; Shorter version appeared at ISIT (International Symposium
on Information Theory) 2015; some typos correcte
- …