6 citations · 8 across the 6 of their papers we have counts for
7 papers
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 …
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…