TY - JOUR

T1 - Lossless Coding of Correlated Sources With Actions

AU - Sabag, Oron

AU - Permuter, Haim H.

AU - Cohen, Asaf

N1 - Funding Information:
O. Sabag and H. H. Permuter were supported in part by the Israel Science Foundation and in part by the European Research Council under the European Union's Seventh Framework Programme (FP7/2007-2013)/ERC under Grant 337752. A. Cohen was supported by the European Union Horizon 2020 Research and Innovation Programme SUPERFLUIDITY under Grant 671566.
Publisher Copyright:
© 2016 IEEE.

PY - 2017/2/1

Y1 - 2017/2/1

N2 - This paper studies the problem of the distributed compression of correlated sources with an action-dependent joint distribution. This class of problems is, in fact, an extension of the Slepian-Wolf model, but where cost-constrained actions taken by the encoder or the decoder affect the generation of one of the sources. The purpose of this paper is to study the impact of actions on the achievable rates. In particular, two cases where transmission occurs over a rate-limited link are studied; case A for actions taken at the decoder and case B where actions are taken at the encoder. A complete single-letter characterization of the set of achievable rates is given in both cases. Furthermore, a network coding setup for the case where actions are taken at the encoder is investigated. The sources are generated at different nodes of the network and are required at a set of terminal nodes, yet transmission occurs over a general, acyclic, directed network. For this setup, generalized cut-set bounds are derived, and a full characterization of the set of achievable rates using single-letter expressions is provided. For this scenario, random linear network coding is proved to be optimal, even though this is not a classical multicast problem. In addition, two binary examples are investigated and demonstrate how actions taken at different nodes of the system have a significant effect on the achievable rate region, when compared with a naive time-sharing strategy.

AB - This paper studies the problem of the distributed compression of correlated sources with an action-dependent joint distribution. This class of problems is, in fact, an extension of the Slepian-Wolf model, but where cost-constrained actions taken by the encoder or the decoder affect the generation of one of the sources. The purpose of this paper is to study the impact of actions on the achievable rates. In particular, two cases where transmission occurs over a rate-limited link are studied; case A for actions taken at the decoder and case B where actions are taken at the encoder. A complete single-letter characterization of the set of achievable rates is given in both cases. Furthermore, a network coding setup for the case where actions are taken at the encoder is investigated. The sources are generated at different nodes of the network and are required at a set of terminal nodes, yet transmission occurs over a general, acyclic, directed network. For this setup, generalized cut-set bounds are derived, and a full characterization of the set of achievable rates using single-letter expressions is provided. For this scenario, random linear network coding is proved to be optimal, even though this is not a classical multicast problem. In addition, two binary examples are investigated and demonstrate how actions taken at different nodes of the system have a significant effect on the achievable rate region, when compared with a naive time-sharing strategy.

KW - Actions

KW - Slepian-Wolf source coding

KW - correlated sources

KW - distributed compression

KW - network coding

KW - random linear network coding

UR - http://www.scopus.com/inward/record.url?scp=85010310970&partnerID=8YFLogxK

U2 - 10.1109/TIT.2016.2610432

DO - 10.1109/TIT.2016.2610432

M3 - Article

AN - SCOPUS:85010310970

SN - 0018-9448

VL - 63

SP - 1237

EP - 1252

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 2

M1 - 7570176

ER -