50 citations · 71 across the 16 of their papers we have counts for
17 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…
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…
Multiple Packing: Lower Bounds via Error Exponents
Yihan Zhang, Shashank Vatedka
We derive lower bounds on the maximal rates for multiple packings in high-dimensional Euclidean spaces. Multiple packing is a natural generalization of the sphere packing problem.…
Multiple Packing: Lower Bounds via Infinite Constellations
Yihan Zhang, Shashank Vatedka
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let …
Multiple Packing: Lower and Upper Bounds
Yihan Zhang, Shashank Vatedka
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let …
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…
Bounds for Multiple Packing and List-Decoding Error Exponents
Yihan Zhang, Shashank Vatedka
We revisit the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0…
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…
List Decoding Random Euclidean Codes and Infinite Constellations
Yihan Zhang, Shashank Vatedka
We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the sourc…
Quadratically Constrained Myopic Adversarial Channels
Yihan Zhang, Shashank Vatedka, Sidharth Jaggi +1
We study communication in the presence of a jamming adversary where quadratic power constraints are imposed on the transmitter and the jammer. The jamming signal is allowed to be a…
Improving the Performance of Nested Lattice Codes Using Concatenation
Shashank Vatedka, Navin Kashyap
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive white Gaussian (AWGN) channel. The main objective of t…
A Lattice Coding Scheme for Secret Key Generation from Gaussian Markov Tree Sources
Shashank Vatedka, Navin Kashyap
In this article, we study the problem of secret key generation in the multiterminal source model, where the terminals have access to correlated Gaussian sources. We assume that the…
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…
Some "Goodness" Properties of LDA Lattices
Shashank Vatedka, Navin Kashyap
We study some structural properties of Construction-A lattices obtained from low density parity check (LDPC) codes over prime fields. Such lattices are called low density Construct…
Secure Compute-and-Forward in a Bidirectional Relay
Shashank Vatedka, Navin Kashyap, Andrew Thangaraj
We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forw…