相关论文: Structural Characteristics of Two-Sender Index Cod…
Index coding, a source coding problem over broadcast channels, has been a subject of both theoretical and practical interest since its introduction (by Birk and Kol, 1998). In short, the problem can be defined as follows: there is an input…
The index coding problem is studied from an interference alignment perspective, providing new results as well as new insights into, and generalizations of, previously known results. An equivalence is established between multiple unicast…
This letter investigates a new class of index coding problems. One sender broadcasts packets to multiple users, each desiring a subset, by exploiting prior knowledge of linear combinations of packets. We refer to this class of problems as…
A source coding problem over a noiseless broadcast channel where the source is pre-informed about the contents of the cache of all receivers, is an index coding problem. Furthermore, if each message is requested by one receiver, then we…
This paper studies noisy index coding problems over single-input single-output broadcast channels. The codewords from a chosen index code of length $N$ are transmitted after $2^N$-PSK modulation over an AWGN channel. In "Index Coded PSK…
This letter investigates the role of index coding in the capacity of AWGN broadcast channels with receiver message side information. We first show that index coding is unnecessary where there are two receivers; multiplexing coding and…
A single unicast index coding problem (SUICP) is called symmetric neighboring and consecutive (SNC) side-information problem if it has $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having…
This paper proposes a novel achievable scheme for the index problem and applies it to the caching problem. Index coding and caching are noiseless broadcast channel problems where receivers have message side information.In the index coding…
An index code for broadcast channel with receiver side information is locally decodable if each receiver can decode its demand by observing only a subset of the transmitted codeword symbols instead of the entire codeword. Local decodability…
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has $K$ messages and $K$ receivers, the $k$th receiver $R_{k}$ wanting the $k$th message $x_{k}$ and having the interference with $D$ messages after…
The distributed index coding problem is studied, whereby multiple messages are stored at different servers to be broadcast to receivers with side information. First, the existing composite coding scheme is enhanced for the centralized…
This paper considers a base station that delivers packets to multiple receivers through a sequence of coded transmissions. All receivers overhear the same transmissions. Each receiver may already have some of the packets as side…
This paper studies pliable index coding, in which a sender broadcasts information to multiple receivers through a shared broadcast medium, and the receivers each have some message a priori and want any message they do not have. An approach,…
In this paper, new index coding problems are studied, where each receiver has erroneous side information. Although side information is a crucial part of index coding, the existence of erroneous side information has not yet been considered.…
The capacity of symmetric, neighboring and consecutive side-information single unicast index coding problems (SNC-SUICP) with number of messages equal to the number of receivers was given by Maleki, Cadambe and Jafar. For these index coding…
We study the fundamental problem of index coding under an additional privacy constraint that requires each receiver to learn nothing more about the collection of messages beyond its demanded messages from the server and what is available to…
The index coding problem involves a sender with K messages to be transmitted across a broadcast channel, and a set of receivers each of which demands a subset of the K messages while having prior knowledge of a different subset as side…
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…
We introduce the blind index coding (BIC) problem, in which a single sender communicates distinct messages to multiple users over a shared channel. Each user has partial knowledge of each message as side information. However, unlike classic…
The index coding problem includes a server, a group of clients, and a set of data chunks. While each client wants a subset of the data chunks and already has another subset as its side information, the server transmits some uncoded data…