Polynomial-time algorithms for coding across multiple unicasts

Simple item page
dc.creatorHo, Tracey
dc.date2006-04-25
dc.date.accessioned2026-07-07T07:09:25Z
dc.date.available2026-07-07T07:09:25Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0604096
dc.identifierhttp://arxiv.org/abs/cs/0604096
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111057
dc.subjectNetworking and Internet Architecture
dc.titlePolynomial-time algorithms for coding across multiple unicasts
dc.typetext

Files

Collections

arXiv