相关论文: Uniprior Index Coding
In the pliable variant of index coding, receivers are allowed to decode any new message not known a priori. Optimal code design for this variant involves identifying each receiver's choice of a new message that minimises the overall…
Motivated by applications in distributed storage and distributed computation, we introduce embedded index coding (EIC). EIC is a type of distributed index coding in which nodes in a distributed system act as both senders and receivers of…
We show that the network coding and index coding problems are equivalent. This equivalence holds in the general setting which includes linear and non-linear codes. Specifically, we present an efficient reduction that maps a network coding…
In this paper, linear index codes with multiple senders are studied, where every receiver receives encoded messages from all senders. A new fitting matrix for the multiple senders is proposed and it is proved that the minimum rank of the…
This paper introduces the ${\it decentralized}$ Pliable Index CODing (PICOD) problem: a variant of the Index Coding (IC) problem, where a central transmitter serves ${\it pliable}$ users with message side information; here, pliable refers…
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We study the edge-identifying code problem, i.e. the identifying code…
We study the problem of constructing good space-time codes for broadcasting $K$ independent messages over a MIMO network to $L$ users, where each user demands all the messages and already has a subset of messages as side information. As a…
We consider the function computation problem in a three node network with one encoder and two decoders. The encoder has access to two correlated sources $X$ and $Y$. The encoder encodes $X^n$ and $Y^n$ into a message which is given to two…
This paper investigates the linear precoder design that maximizes the average mutual information of multiple-input multiple-output channels with finite-alphabet inputs and statistical channel state information known at the transmitter. This…
Index coding employs coding across clients within the same broadcast domain. This typically assumes that all clients learn the coding matrix so that they can decode and retrieve their requested data. However, learning the coding matrix can…
Index coded PSK modulation over an AWGN broadcast channel, for a given index coding problem (ICP) is studied. For a chosen index code and an arbitrary mapping (of broadcast vectors to PSK signal points), we have derived a decision rule for…
We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…
A single unicast index coding problem (SUICP) with symmetric neighboring and consecutive side-information (SNCS) has $K$ messages and $K$ receivers, the $k$th receiver $R_k$ wanting the $k$th message $x_k$ and having the side-information…
In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks with an arbitrary topology. We define $r$-solvable networks,…
The two-sender groupcast index coding problem (TGICP) consists of a set of receivers, where all the messages demanded by the set of receivers are distributed among the two senders. The senders can possibly have a set of messages in common.…
In pliable index coding (PICOD), a number of clients are connected via a noise-free broadcast channel to a server which has a list of messages. Each client has a unique subset of messages at the server as side-information, and requests for…
We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliably transport the output of two correlated information sources…
Noisy index coding problems over AWGN channel are considered. For a given index coding problem and a chosen scalar linear index code of length $N$, we propose to transmit the $N$ index coded bits as a single signal from a $2^N$- PSK…
We propose a scheme that universally achieves the smallest possible compression rate for a class of sources with side information, and develop an application of this result for a joint source channel coding problem over a broadcast channel.
Side information provides a pivotal role for message delivery in many communication scenarios to accommodate increasingly large data sets, e.g., caching networks. Although index coding provides a fundamental modeling framework to exploit…