2006/04/25 by Tracey Ho, Ho, Tracey
Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #cs.NI
paper · pdf · doi:10.48550/arxiv.cs/0604096
arxiv created 2006/04/25 · openalex publication_date 2006/04/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network codes within the class of network codes restricted to XOR coding between pairs of flows.