Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Vatedka, Shashank"'
Autor:
Zhang, Yihan, Vatedka, Shashank
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. For any $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $, a multiple packing is a
Externí odkaz:
http://arxiv.org/abs/2211.04408
Autor:
Zhang, Yihan, Vatedka, Shashank
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 $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set $\mathcal{C
Externí odkaz:
http://arxiv.org/abs/2211.04407
Autor:
Zhang, Yihan, Vatedka, Shashank
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 $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set $\mathcal{C
Externí odkaz:
http://arxiv.org/abs/2211.04406
It was recently shown that the lossless compression of a single source $X^n$ is achievable with a notion of strong locality; any $X_i$ can be decoded from a constant number of compressed bits, with a vanishing in $n$ probability of error. By contrast
Externí odkaz:
http://arxiv.org/abs/2204.07518
Autor:
Zhang, Yihan, Vatedka, Shashank
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 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set $\mathcal
Externí odkaz:
http://arxiv.org/abs/2107.05161
Autor:
Vatedka, Shashank
In this work, we study two problems in information-theoretic security. Firstly, we study a wireless network where two nodes want to securely exchange messages via an honest-but-curious bidirectional relay. There is no direct link between the user nod
Externí odkaz:
http://etd.iisc.ernet.in/2005/3584
http://etd.iisc.ernet.in/abstracts/4452/G28181-Abs.pdf
http://etd.iisc.ernet.in/abstracts/4452/G28181-Abs.pdf
This paper addresses the problem of data compression with local decoding and local update. A compression scheme has worst-case local decoding $d_{wc}$ if any bit of the raw file can be recovered by probing at most $d_{wc}$ bits of the compressed sequ
Externí odkaz:
http://arxiv.org/abs/2001.08679
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-constrained jammer. This models the wireless communication scenario wh
Externí odkaz:
http://arxiv.org/abs/2001.02575
Autor:
Vatedka, Shashank, Tchamkerten, Aslan
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 the following features. The rate can be made arbitrarily close to the e
Externí odkaz:
http://arxiv.org/abs/1909.06444
Autor:
Zhang, Yihan, Vatedka, Shashank
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 source and the adversary have power constraints $ P $ and $ N $ respectivel
Externí odkaz:
http://arxiv.org/abs/1901.03790