Related papers: Structural Characteristics of Two-Sender Index Cod…
This paper considers the source coding problem with broadcast side information. The side information is sent to two receivers through a noisy broadcast channel. We provide an outer bound of the rate--distortion--bandwidth (RDB) quadruples…
We study and compare three coded schemes for single-server wireless broadcast of multiple description coded content to heterogeneous users. The users (sink nodes) demand different number of descriptions over links with different packet loss…
This paper deals with scalar linear index codes for canonical multiple unicast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetric (with respect to the…
This work introduces a hypergraph formulation that generalizes the classical paradigm of Bar-Yossef et al. to the multi-sender index coding (MSIC) setting. Central to the model is a 4-regular side-information hypergraph G, a new adjacency…
Partial clique covering is one of the most basic coding schemes for index coding problems, generalizing clique and cycle covering on the side information digraph and further reducing the achievable broadcast rate. In this paper, we start…
An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability…
Index coding, or broadcasting with side information, is a network coding problem of most fundamental importance. In this problem, given a directed graph, each vertex represents a user with a need of information, and the neighborhood of each…
Integrated Sensing and Communication (ISAC) systems have garnered significant attention due to their capability to simultaneously achieve efficient communication and environmental sensing. A core objective in this field is characterizing…
The two-user interference channel is a model for multi one-to-one communications, where two transmitters wish to communicate with their corresponding receivers via a shared wireless medium. Two most common and simple coding schemes are time…
We propose an adaptive lossy joint source-channel coding (JSCC) scheme for sending correlated sources over two-terminal discrete-memoryless two-way channels (DM-TWCs). The main idea is to couple the independent operations of the terminals…
Multicasting $K$ independent messages via multiple-input multiple-output (MIMO) channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered…
In this paper, we study the capacity region of the general distributed index coding. In contrast to the traditional centralized index coding where a single server contains all $n$ messages requested by the receivers, in the distributed…
The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source,…
Lossy coding of correlated sources over a multiple access channel (MAC) is studied. First, a joint source-channel coding scheme is presented when the decoder has correlated side information. Next, the optimality of separate source and…
We study the information leakage to a guessing adversary in index coding with a general message distribution. Under both vanishing-error and zero-error decoding assumptions, we develop lower and upper bounds on the optimal leakage rate,…
In this paper, we study the wireline two-unicast-Z communication network over directed acyclic graphs. The two-unicast-Z network is a two-unicast network where the destination intending to decode the second message has apriori side…
This paper deals with vector linear index codes for multiple unicast index coding problems where there is a source with K messages and there are K receivers each wanting a unique message and having symmetric (with respect to the receiver…
In this paper, we propose a signal-aligned network coding (SNC) scheme for K-user time-varying multiple-input multiple-output (MIMO) interference channels with limited receiver cooperation. We assume that the receivers are connected to a…
An index coding (IC) problem consisting of a server and multiple receivers with different side-information and demand sets can be equivalently represented using a fitting matrix. A scalar linear index code to a given IC problem is a matrix…
This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD$(t)$ problem there are $m$ messages, $n$ users and each user has a distinct message side information set, as in the…