8 citations · 8 across the 5 of their papers we have counts for
14 papers
Second-Order Asymptotics of Two-Sample Tests
K V Harsha, Jithin Ravi, Tobias Koch
In two-sampling testing, one observes two independent sequences of independent and identically distributed random variables distributed according to the distributions and $P_…
On the Second-Order Asymptotics of the Hoeffding Test and Other Divergence Tests
K. V. Harsha, Jithin Ravi, Tobias Koch
Consider a binary statistical hypothesis testing problem, where independent and identically distributed random variables are either distributed according to the null hypo…
Second-Order Asymptotics of Hoeffding-Like Hypothesis Tests
K. V. Harsha, Jithin Ravi, Tobias Koch
We consider a binary statistical hypothesis testing problem, where independent and identically distributed random variables are either distributed according to the null h…
Fundamental Limits of Demand-Private Coded Caching
Chinmay Gurjarpadhye, Jithin Ravi, Sneha Kamath +2
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 de…
Scaling Laws for Gaussian Random Many-Access Channels
Jithin Ravi, Tobias Koch
This paper considers a Gaussian multiple-access channel with random user activity where the total number of users and the average number of active users may grow wit…
Private Index Coding
Varun Narayanan, Jithin Ravi, Vivek K. Mishra +3
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 it…
Capacity per Unit-Energy of Gaussian Random Many-Access Channels
Jithin Ravi, Tobias Koch
We consider a Gaussian multiple-access channel with random user activity where the total number of users and the average number of active users may be unbounded. For…
Demand-Private Coded Caching and the Exact Trade-off for N=K=2
Sneha Kamath, Jithin Ravi, Bikash Kumar Dey
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…
Capacity per Unit-Energy of Gaussian Many-Access Channels
Jithin Ravi, Tobias Koch
We consider a Gaussian multiple-access channel where the number of transmitters grows with the blocklength . For this setup, the maximum number of bits that can be transmitted r…
Interactive Secure Function Computation
Deepesh Data, Gowtham R. Kurri, Jithin Ravi +1
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 inf…
Broadcast Function Computation with Complementary Side Information
Jithin Ravi, Bikash Kumar Dey
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 and . The encoder en…
Function Computation through a Bidirectional Relay
Jithin Ravi, Bikash Kumar Dey
We consider a function computation problem in a three node wireless network. Nodes A and B observe two correlated sources and respectively, and want to compute a function $…
Oblivious Transfer over Wireless Channels
Jithin Ravi, Bikash Kumar Dey, Emanuele Viterbo
We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and rec…
Zero-Error Function Computation through a Bidirectional Relay
Jithin Ravi, Bikash Kumar Dey
We consider zero error function computation in a three node wireless network. Nodes A and B observe and respectively, and want to compute a function with zero erro…