A Generalized Cut-Set Bound
Amin Aminzadeh Gohari, Venkat Anantharam
TL;DR
This paper extends the classical cut-set bound to a broader context, enabling analysis of lossy function transmission over complex multiterminal networks with correlated sources.
Contribution
It introduces a generalized cut-set bound applicable to lossy transmission of functions in correlated multiterminal networks, broadening theoretical understanding.
Findings
Provides a new theoretical bound for lossy function transmission
Applicable to arbitrary correlated sources and networks
Enhances analysis of multiterminal network performance
Abstract
In this paper, we generalize the well known cut-set bound to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multiterminal network.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · graph theory and CDMA systems · Advanced Graph Theory Research