Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

CORR
2006
Springer

favoriteEmaildiscussreport

114views Education» more CORR 2006»

Polynomial-time algorithms for coding across multiple unicasts

13 years 4 months ago

Polynomial-time algorithms for coding across multiple unicasts

Download www.its.caltech.edu

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.

Tracey Ho

Real-time Traffic

CORR 2006 | Education | Efficient Polynomial Time | Network Codes | Optimal Network Codes |

claim paper

Related Content

» Unicast and Multicast QoS Routing with Multiple Constraints

» Opportunistic Network Coding for Wireless Networks

» Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams

» On achieving optimal throughput with network coding

» Rate Control With Pairwise Intersession Network Coding

» Multicast and unicast realtime video streaming over wireless LANs

» Lossaware network coding for unicast wireless sessions design implementation and performan...

» SNPPicker High quality tag SNP selection across multiple populations

» Loss Tomography in General Topologies with Network Coding

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Tracey Ho

Comments (0)