Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Roy Timo"'
Autor:
Roy Timo, Lawrence Ong
Publikováno v:
IEEE Transactions on Communications. 63:4809-4823
We consider a joint source-channel coding problem on a finite-field multiway relay channel, and we give closed-form lower and upper bounds on the optimal source-channel rate. These bounds are shown to be tight for all discrete memoryless sources in a
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2018
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2018, 64 (11), pp.6996-7016. ⟨10.1109/TIT.2018.2835507⟩
IEEE Transactions on Information Theory, 2018
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2018, 64 (11), pp.6996-7016. ⟨10.1109/TIT.2018.2835507⟩
We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2017, 63 (2), pp.1199-1226
ITW
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2017, 63 (2), pp.1199-1226
ITW
Our goal is to study the effect of the number of conferencing rounds on the capacity of large interference networks. We do this at hand of the per-user multiplexing gain (MG) of Wyner's soft-handoff model with dedicated conferencing links between nei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ae1f49f00f553a0ed027b68943c50b4
https://hal.telecom-paris.fr/hal-02287511
https://hal.telecom-paris.fr/hal-02287511
Autor:
Roy Timo, Badri N. Vellambi
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 single-letter c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7e63f4a6a52c40c5dcc5366838c94435
http://arxiv.org/abs/1611.05467
http://arxiv.org/abs/1611.05467
Publikováno v:
International Zurich Seminar on Communications
International Zurich Seminar on Communications, Mar 2016, Zurich, Switzerland
IEEE Transactions on Information Theory
International Zurich Seminar on Communications-Proceedings
International Zurich Seminar on Communications, Mar 2016, Zurich, Switzerland
IEEE Transactions on Information Theory
International Zurich Seminar on Communications-Proceedings
In this paper, we consider a lossy single-user caching problem with correlated sources. We first describe the fundamental interplay between the source correlations, the capacity of the user’s cache, the user’s reconstruction distortion requiremen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ae60e9bc41ee1b590d012ec8e6671fb
http://arxiv.org/abs/1610.07304
http://arxiv.org/abs/1610.07304
Publikováno v:
ITW
This paper presents a Shannon-type lower bound on the rate-distortion (RD) function of the Bernoulli-Gaussian spike source. The lower bound is valid in all distortion regimes and asymptotically tight for small distortions.
Publikováno v:
IEEE Information Theory Workshop 2016
IEEE Information Theory Workshop 2016, Sep 2016, Cambridge, United Kingdom
ITW
IEEE Information Theory Workshop 2016, Sep 2016, Cambridge, United Kingdom
ITW
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 memories wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea9e2ae8420459b8b6ad60a0dff91e9e
https://hal.telecom-paris.fr/hal-02288482
https://hal.telecom-paris.fr/hal-02288482
Publikováno v:
ISIT
This paper studies fixed-length compression with multiple constraints in the finite blocklength regime. We introduce two different average distortion measures and consider constraints for individual source outcomes. The concept of d-tilted informatio
Publikováno v:
ISIT 2016
ISIT 2016, Jul 2016, Barcelona, Spain
ISIT
ISIT 2016, Jul 2016, Barcelona, Spain
ISIT
We study the capacity of a broadcast packet-erasure network with receiver caching. The receivers in the network are divided into two groups: A group of strong receivers with small packet erasure probabilities, and a group of weak receivers with large
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1821dacad197c0bfc11d17f0e549870
https://hal.telecom-paris.fr/hal-02288481
https://hal.telecom-paris.fr/hal-02288481
Autor:
Michele Wigger, Roy Timo
Publikováno v:
SPCOM
SPCOM, Jun 2016, Bangalore, India
SPCOM, Jun 2016, Bangalore, India
We consider a three-terminal distributed hypothesis testing against independence problem. Two terminals, which act as decision centers, are required to decide whether their observed sequences are probabilistically independent of the sequence observed