Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Ravi, Jithin"'
Consider a binary statistical hypothesis testing problem, where $n$ independent and identically distributed random variables $Z^n$ are either distributed according to the null hypothesis $P$ or the alternative hypothesis $Q$, and only $P$ is known. A
Externí odkaz:
http://arxiv.org/abs/2403.03537
We consider a binary statistical hypothesis testing problem, where $n$ independent and identically distributed random variables $Z^n$ are either distributed according to the null hypothesis $P$ or the alternate hypothesis $Q$, and only $P$ is known.
Externí odkaz:
http://arxiv.org/abs/2205.05631
We consider the coded caching problem with an additional privacy constraint that a user should not get any information about the demands of the other users. We first show that a demand-private scheme for $N$ files and $K$ users can be obtained from a
Externí odkaz:
http://arxiv.org/abs/2101.07127
Autor:
Ravi, Jithin, Koch, Tobias
This paper considers a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may grow with the blocklength $n$. For this channel, it studies the maximum number
Externí odkaz:
http://arxiv.org/abs/2012.10350
Autor:
Narayanan, Varun, Ravi, Jithin, Mishra, Vivek K., Dey, Bikash Kumar, Karamchandani, Nikhil, Prabhakaran, Vinod M.
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 it as sid
Externí odkaz:
http://arxiv.org/abs/2006.00257
Autor:
Ravi, Jithin, Koch, Tobias
We consider a Gaussian multiple-access channel with random user activity where the total number of users $\ell_n$ and the average number of active users $k_n$ may be unbounded. For this channel, we characterize the maximum number of bits that can be
Externí odkaz:
http://arxiv.org/abs/2005.07436
The distributed coded caching problem has been studied extensively in the recent past. While the known coded caching schemes achieve an improved transmission rate, they violate the privacy of the users since in these schemes the demand of one user is
Externí odkaz:
http://arxiv.org/abs/1911.06995
Autor:
Ravi, Jithin, Koch, Tobias
We consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength $n$. For this setup, the maximum number of bits that can be transmitted reliably per unit-energy is analyzed. We show that if the number of use
Externí odkaz:
http://arxiv.org/abs/1904.11742
We consider interactive computation of randomized functions between two users with the following privacy requirement: the interaction should not reveal to either user any extra information about the other user's input and output other than what can b
Externí odkaz:
http://arxiv.org/abs/1812.03838
Autor:
Ravi, Jithin, Dey, Bikash Kumar
We consider the function computation problem in a three node network with one encoder and two decoders. The encoder has access to two correlated sources $X$ and $Y$. The encoder encodes $X^n$ and $Y^n$ into a message which is given to two decoders. D
Externí odkaz:
http://arxiv.org/abs/1610.00867