Search Results for author:
Found 6 papers, 0 papers with code
Multilevel Topological Interference Management: A TIM-TIN Perspective
The robust principles of treating interference as noise (TIN) when it is sufficiently weak, and avoiding it when it is not, form the background of this work.
Information Theory Information Theory
A New Design of Cache-aided Multiuser Private Information Retrieval with Uncoded Prefetching
This paper considers the MuPIR problem with two messages, arbitrary number of users and databases where uncoded prefetching is assumed, i. e., the users directly copy some bits from the library as their cached contents.
On Secure Distributed Linearly Separable Computation
Then we focus on the case where the computation cost of each server is minimum and aim to minimize the size of the randomness variable introduced in the system while achieving the optimal communication cost.
Information Theory Information Theory
Information Theoretic Secure Aggregation with User Dropouts
The identity of the dropped users is not known a priori and the server needs to securely recover the sum of the remaining surviving users.
Cache-aided General Linear Function Retrieval
Coded Caching, proposed by Maddah-Ali and Niesen (MAN), has the potential to reduce network traffic by pre-storing content in the users' local memories when the network is underutilized and transmitting coded multicast messages that simultaneously benefit many users at once during peak-hour times.
Information Theory Information Theory
On the Fundamental Limits of Cache-aided Multiuser Private Information Retrieval
Based on the proposed novel approach of \emph{cache-aided interference alignment (CIA)}, first, for the MuPIR problem with $K=2$ messages, $K_{\rm u}=2$ users and $N\ge 2$ databases, we propose achievable retrieval schemes for both uncoded and general cache placement.
