Polynomial-time algorithms for coding across multiple unicasts

Details Polynomial-time algorithms for coding across multiple unicasts Polynomial-time algorithms for coding across multiple unicasts

2006-04-25

arxiv.org/abs/cs/0604096v1

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Polynomial-time algorithms for coding across multiple unicasts does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial-time algorithms for coding across multiple unicasts, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial-time algorithms for coding across multiple unicasts will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-433210