2009/09/29 by Sagar Shenvi, Shenvi, Sagar, Bikash Kumar Dey +1
Computer Science · Engineering · Mathematics · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.0909.5268
5 pages, 6 figures. Revised Version. Final manuscript for ICC 2010
openalex publication_date 2009/09/29 · arxiv created 2010/02/04 · arxiv updated 2010/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider a directed acyclic network where there are two source-terminal pairs and the terminals need to receive the symbols generated at the respective sources. Each source independently generates an i.i.d. random process over the same alphabet. Each edge in the network is error-free, delay-free, and can carry one symbol from the alphabet per use. We give a simple necessary and sufficient condition for being able to simultaneously satisfy the unicast requirements of the two source-terminal pairs at rate-pair (1,1) using vector network coding. The condition is also sufficient for doing this using only "XOR" network coding and is much simpler compared to the necessary and sufficient conditions known from previous work. Our condition also yields a simple characterization of the capacity region of a double-unicast network which does not support the rate-pair (1,1).