5 citations · 12 across the 10 of their papers we have counts for
12 papers
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…
Local Decoding in Distributed Compression
Shashank Vatedka, Venkat Chandar, Aslan Tchamkerten
It was recently shown that the lossless compression of a single source is achievable with a notion of strong locality; any can be decoded from a constant number of comp…
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…
Sampling Constrained Asynchronous Communication: How to Sleep Efficiently
Venkat Chandar, Aslan Tchamkerten
The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infre…
Update-Efficiency and Local Repairability Limits for Capacity Approaching Codes
Arya Mazumdar, Venkat Chandar, Gregory W. Wornell
Motivated by distributed storage applications, we investigate the degree to which capacity achieving encodings can be efficiently updated when a single information bit changes, and…
Energy and Sampling Constrained Asynchronous Communication
Aslan Tchamkerten, Venkat Chandar, Giuseppe Caire
The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infre…