A Generalized Cut-Set Bound

2009/04/29 by Amin Gohari, Amin Aminzadeh Gohari, Gohari, Amin Aminzadeh +2
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT

paper · pdf · doi:10.48550/arxiv.0904.4542

22 pages, 1 figure, a short version of it appears in ISIT 2009

arxiv created 2009/04/29 · openalex publication_date 2009/04/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Generalized Cut-Set Bounds for Broadcast Networks
• Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources
• A Generalized Cut-Set Bound for Deterministic Multi-Flow Networks and its Applications
• Are Generalized Cut-Set Bounds Tight for the Deterministic Interference Channel?
• Information Theoretic Cut-set Bounds on the Capacity of Poisson Wireless Networks