Polynomial-time algorithms for coding across multiple unicasts
Tracey Ho
Abstract
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.
Create a lesson
Related papers
Exploring the Power Consumption of ERC-4337 Bundling on Server Infrastructure
Claudiu-Nicu Bărbieru, Oana-Otilia Captarencu, Pascal Felber et al.
MusiSPARQ: Subscription-Aware Adaptive Resource Control for Musical Metaverse Services
Ali Al Housseini, Jaime Llorca, Omran Ayoub
Survival-Time Risk Beyond Low-Order Channel Models: Identifiability and Scheduling
Ruifeng Zheng, Zhihan Xu, Pit Hofmann et al.
From Reactive to Agentic Resilience: Multi-Timescale AI-RAN Orchestration Under Signaling Storms
Sotiris Chatzimiltis, Mahdi Boloursaz Mashhadi, Mohammad Shojafar et al.
Pod-wise Multimodal Federated Learning for Heterogeneous IoT
Joy Okolo, Zihao Ding, Jun Huang
DisC: Incentive Design for Green, Robust, and Fair Client Self-Participation in OTA Federated Learning
Driss Choukri, Essaid Sabir, Abdelkrim Haqiq