research
∙
09/20/2023
Byzantine Multiple Access Channels – Part II: Communication With Adversary Identification
We introduce the problem of determining the identity of a byzantine user...
share
research
∙
04/27/2023
Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents
We study the Chernoff-Stein exponent of the following binary hypothesis ...
research
∙
11/23/2022
Byzantine Multiple Access Channels – Part I: Reliable Communication
We study communication over a Multiple Access Channel (MAC) where users ...
research
∙
05/07/2021
Compound Arbitrarily Varying Channels
We propose a communication model, that we call compound arbitrarily vary...
research
∙
05/07/2021
Communication With Adversary Identification in Byzantine Multiple Access Channels
We introduce the problem of determining the identity of a byzantine user...
research
∙
01/18/2021
Fundamental Limits of Demand-Private Coded Caching
We consider the coded caching problem with an additional privacy constra...
research
∙
05/30/2020
Private Index Coding
We study the fundamental problem of index coding under an additional pri...
research
∙
11/16/2019
Demand-Private Coded Caching and the Exact Trade-off for N=K=2
The distributed coded caching problem has been studied extensively in th...
research
∙
04/26/2019
Byzantine Multiple Access
We study communication over multiple access channels (MAC) where one of ...
research
∙
09/11/2018
Arbitrarily Varying Remote Sources
We study a lossy source coding problem for an arbitrarily varying remote...
research
∙
05/08/2018