A generalized cut-set bound

In this paper, we generalize the well known cutset bound (see for example [1, p. 444]) to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multiterminal network.

[1]  Michael Gastpar.  Cut-set arguments for source-channel networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[2]  M. Franceschetti,et al.  Network coding for computing , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[3]  Alon Orlitsky,et al.  Coding for computing , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  Hirosuke Yamamoto,et al.  Wyner-Ziv theory for a general function of the correlated sources , 1982, IEEE Trans. Inf. Theory.

[6]  Panganamala Ramana Kumar,et al.  Computing and communicating functions over sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[7]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part I , 2010, IEEE Transactions on Information Theory.

[8]  Serap A. Savari,et al.  Cut sets and information flow in networks of two-way channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  Masoud Salehi,et al.  Multiple access channels with arbitrarily correlated sources , 1980, IEEE Trans. Inf. Theory.

[10]  Venkat Anantharam,et al.  Information-Theoretic Key Agreement of Multiple Terminals—Part II: Channel Model , 2010, IEEE Transactions on Information Theory.

[11]  Michael Gastpar,et al.  Computation Over Multiple-Access Channels , 2007, IEEE Transactions on Information Theory.