research
∙
11/08/2022
Multiple Packing: Lower Bounds via Error Exponents
We derive lower bounds on the maximal rates for multiple packings in hig...
share
research
∙
11/08/2022
Multiple Packing: Lower Bounds via Infinite Constellations
We study the problem of high-dimensional multiple packing in Euclidean s...
research
∙
11/08/2022
Multiple Packing: Lower and Upper Bounds
We study the problem of high-dimensional multiple packing in Euclidean s...
research
∙
04/15/2022
Random Access in Distributed Source Coding
The lossless compression of a single source X^n was recently shown to be...
research
∙
07/12/2021
Bounds for Multiple Packing and List-Decoding Error Exponents
We revisit the problem of high-dimensional multiple packing in Euclidean...
research
∙
01/23/2020
O(loglog n) Worst-Case Local Decoding and Update Efficiency for Data Compression
This paper addresses the problem of data compression with local decoding...
research
∙
01/08/2020
Quadratically Constrained Two-way Adversarial Channels
We study achievable rates of reliable communication in a power-constrain...
research
∙
09/13/2019
Local Decode and Update for Big Data Compression
This paper investigates data compression that simultaneously allows loca...
research
∙
01/12/2019
List Decoding Random Euclidean Codes and Infinite Constellations
We study the list decodability of different ensembles of codes over the ...
research
∙
01/18/2018