Roy Timo
YOU?
Author Swipe
View article: Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels
Tracking Unstable Autoregressive Sources Over Discrete Memoryless Channels Open
We consider the problem of tracking, in realtime, an unstable autoregressive (AR) source over a discrete memoryless channel (DMC). We present computable achievable bounds on the optimal tracking error for general DMCs, and we particularize…
View article: Common Reconstructions in the Successive Refinement Problem With Receiver Side Information
Common Reconstructions in the Successive Refinement Problem With Receiver Side Information Open
We study a variant of the successive refinement problem with receiver side information where the receivers require identical reconstructions. We present general inner and outer bounds for the rate region for this variant and present a sing…
View article: On Hypothesis Testing Against Conditional Independence With Multiple Decision Centers
On Hypothesis Testing Against Conditional Independence With Multiple Decision Centers Open
International audience
View article: On Hypothesis Testing Against Independence with Multiple Decision Centers
On Hypothesis Testing Against Independence with Multiple Decision Centers Open
A distributed binary hypothesis testing problem is studied with one observer and two decision centers. Achievable type-II error exponents are derived for testing against conditional independence when the observer communicates with the two …
View article: On Hypothesis Testing Against Independence with Multiple Decision\n Centers
On Hypothesis Testing Against Independence with Multiple Decision\n Centers Open
A distributed binary hypothesis testing problem is studied with one observer\nand two decision centers. Achievable type-II error exponents are derived for\ntesting against conditional independence when the observer communicates with\nthe t…
View article: A Rate-Distortion Approach to Caching
A Rate-Distortion Approach to Caching Open
This paper takes a rate-distortion approach to understanding the information-theoretic laws governing cache-aided communications systems. Specifically, we characterise the optimal tradeoffs between the delivery rate, cache capacity and rec…
View article: Complete interference mitigation through receiver-caching in Wyner's networks
Complete interference mitigation through receiver-caching in Wyner's networks Open
We present upper and lower bounds on the per-user multiplexing gain (MG) of Wyner's circular soft-handoff model and Wyner's circular full model with cognitive transmitters and receivers with cache memories. The bounds are tight for cache m…
View article: Conferencing in Wyner's Asymmetric Interference Network: Effect of\n Number of Rounds
Conferencing in Wyner's Asymmetric Interference Network: Effect of\n Number of Rounds Open
Our goal is to study the effect of the number of conferencing rounds on the\ncapacity of large interference networks. We do this at hand of the per-user\nmultiplexing gain (MG) of Wyner's soft-handoff model with dedicated\nconferencing lin…
View article: A Multiway Relay Channel With Balanced Sources
A Multiway Relay Channel With Balanced Sources Open
We consider a joint source-channel coding problem on a finite-field multiway\nrelay channel, and we give closed-form lower and upper bounds on the optimal\nsource-channel rate. These bounds are shown to be tight for all discrete\nmemoryles…
View article: Slepian-wolf coding for broadcasting with cooperative base-stations
Slepian-wolf coding for broadcasting with cooperative base-stations Open
We propose a base-station (BS) cooperation model for broadcasting a discrete memoryless source in a cellular or heterogeneous network. The model allows the receivers to use helper BSs to improve network performance, and it permits the rece…
View article: Conferencing in Wyner's asymmetric interference network: Effect of number of rounds
Conferencing in Wyner's asymmetric interference network: Effect of number of rounds Open
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 63, NO. 2, FEBRUARY 2017
View article: Slepian-Wolf Coding for Broadcasting With Cooperative Base-Stations
Slepian-Wolf Coding for Broadcasting With Cooperative Base-Stations Open
We propose a base-station (BS) cooperation model for broadcasting a discrete\nmemoryless source in a cellular or heterogeneous network. The model allows the\nreceivers to use helper BSs to improve network performance, and it permits the\nr…