The Single Source Two Terminal Network with Network Coding

2009/08/20 by Aditya Ramamoorthy, Ramamoorthy, Aditya, Richard D. Wesel +1
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.0908.2847

openalex publication_date 2009/08/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider a communication network with a single source that has a set of messages and two terminals where each terminal is interested in an arbitrary subset of messages at the source. A tight capacity region for this problem is demonstrated. We show by a simple graph-theoretic procedure that any such problem can be solved by performing network coding on the subset of messages that are requested by both the terminals and that routing is sufficient for transferring the remaining messages.

Related

• Single-Source/Sink Network Error Correction Is as Hard as Multiple-Unicast
• A Practical Approach to Joint Network-Source Coding
• Mission impossible: Computing the network coding capacity region
• Joint Network-Source Coding: An Achievable Region with Diversity Routing
• Communicating the sum of sources over a network