A generalized cut-set bound

Authors:
Amin Aminzadeh Gohari;Venkat Anantharam
Affiliations:
EECS Department, University of California, Berkeley, CA;EECS Department, University of California, Berkeley, CA
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 4
Cited 3

Elements of information theory

Elements of information theory
A generalized cut-set bound

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Coding for computing

IEEE Transactions on Information Theory
Computation Over Multiple-Access Channels

IEEE Transactions on Information Theory

A generalized cut-set bound

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Information-theoretic key agreement of multiple terminals: part I

IEEE Transactions on Information Theory
Information-theoretic key agreement of multiple terminal: part II: channel model

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.12

Visualization

Abstract

In this paper, we generalize the well known cut-set 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.