6 citations · 8 across the 8 of their papers we have counts for
6 papers · 1 filter
Compression with Privacy-Preserving Random Access
Venkat Chandar, Aslan Tchamkerten, Shashank Vatedka
We show that an i.i.d.\ binary source sequence can be losslessly compressed at any rate above entropy while ensuring that the decoding of any reveals no info…
One-Bit Distributed Mean Estimation with Unknown Variance
Ritesh Kumar, Shashank Vatedka
In this work, we study the problem of distributed mean estimation with 1-bit communication constraints when the variance is unknown. We focus on the setting where each user has acc…
Worst-Case Local Decoding and Update Efficiency for Data Compression
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten
This paper addresses the problem of data compression with local decoding and local update. A compression scheme has worst-case local decoding if any bit of the raw file ca…
Quadratically Constrained Two-way Adversarial Channels
Yihan Zhang, Shashank Vatedka, Sidharth Jaggi
We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-…
Local Decode and Update for Big Data Compression
Shashank Vatedka, Aslan Tchamkerten
This paper investigates data compression that simultaneously allows local decoding and local update. The main result is a universal compression scheme for memoryless sources with t…
Nested Lattice Codes for Secure Bidirectional Relaying with Asymmetric Channel Gains
Shashank Vatedka, Navin Kashyap
The basic problem of secure bidirectional relaying involves two users who want to exchange messages via an intermediate "honest-but-curious" relay node. There is no direct link bet…