6 citations · 20 across the 10 of their papers we have counts for
13 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 …
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery
Nicolas Resch, Chen Yuan, Yihan Zhang
In this work we consider the list-decodability and list-recoverability of arbitrary -ary codes, for all integer values of . A code is called -list-decodable if…
The Capacity of Causal Adversarial Channels
Yihan Zhang, Sidharth Jaggi, Michael Langberg +1
We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common random…
Network Coding with Myopic Adversaries
Sijie Li, Rawad Bitar, Sidharth Jaggi +1
We consider the problem of reliable communication over a network containing a hidden {\it myopic} adversary who can eavesdrop on some links, jam some links, and d…