Capacity Theorems for Distributed Index Coding
نویسندگان
چکیده
منابع مشابه
Capacity Theorems for Distributed Index Coding
In index coding, a server broadcasts multiple messages to their respective receivers, each with some sideinformation that can be utilized to reduce the amount of communication from the server. Distributed index coding isan extension of index coding in which the messages are now broadcast from multiple servers, each storing differentsubsets of the messages. In this paper, the optimal...
متن کاملStructural Properties of Index Coding Capacity
The index coding capacity is investigated through its structural properties. First, the capacity is characterized in three new multiletter expressions involving the clique number, Shannon capacity, and Lovász theta function of the confusion graph, the latter notion introduced by Alon, Hassidim, Lubetzky, Stav, and Weinstein. The main idea is that every confusion graph can be decomposed into a s...
متن کاملCoding theorems for individual sequences
A quantity called the finite-state complexity is assigned to every infinite sequence of elements drawn from a finite set. This quantity characterizes the largest compression ratio that can be achieved in accurate transmission of the sequence by any finite-state encoder (and decoder). Coding theorems and converses are derived for an individual sequence without any probabilistic characterization,...
متن کاملCoding Theorems for Reversible Embedding
We consider embedding of messages (data-hiding) into i.i.d. host sequences. As in Fridrich et al. [2002] we focus on the case where reconstruction of the host sequence from the composite sequence is required. We study the balance between embedding rate and embedding distortion. First we determine the distortion-rate region corresponding to this setup. Then we generalize this result in two direc...
متن کاملCapacity of Some Index Coding Problems with Symmetric Neighboring Interference
A single unicast index coding problem (SUICP) with symmetric neighboring interference (SNI) has equal number of K messages and K receivers, the kth receiver Rk wanting the kth message xk and having the side-information Kk = (Ik∪xk) , where Ik = {xk−U , . . . , xk−2, xk−1}∪{xk+1, xk+2, . . . , xk+D} is the interference with D messages after and U messages before its desired message. Maleki, Cada...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2020.2977916