most citedEffects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding

88 citations · 89 across the 5 of their papers we have counts for

collaborators

6 papers

cs.IT2012

Round-Robin Streaming with Generations

Yao Li, Péter Vingelmann, Morten Videbæk Pedersen +1

We consider three types of application layer coding for streaming over lossy links: random linear coding, systematic random linear coding, and structured coding. The file being str…

cs.NI2012

Three Schemes for Wireless Coded Broadcast to Heterogeneous Users

Yao Li, Emina Soljanin, Predrag Spasojevic

We study and compare three coded schemes for single-server wireless broadcast of multiple description coded content to heterogeneous users. The users (sink nodes) demand different…

cs.IT2010★ 88 cited

Effects of the Generation Size and Overlap on Throughput and Complexity in Randomized Linear Network Coding

Yao Li, Emina Soljanin, Predrag Spasojevic

To reduce computational complexity and delay in randomized network coded content distribution, and for some other practical reasons, coding is not performed simultaneously over all…

cs.IT2010

Collecting Coded Coupons over Overlapping Generations

Yao Li, Emina Soljanin, Predrag Spasojevic

Coding over subsets (known as generations) rather than over all content blocks in P2P distribution networks and other applications is necessary for a number of practical reasons su…

cs.IT2010★ 1 cited

Collecting Coded Coupons over Generations

Yao Li, Emina Soljanin, Predrag Spasojevic

To reduce computational complexity and delay in randomized network coded content distribution (and for some other practical reasons), coding is not performed simultaneously over al…

cs.IT2010

Rateless Codes for Single-Server Streaming to Diverse Users

Yao Li, Emina Soljanin

We investigate the performance of rateless codes for single-server streaming to diverse users, assuming that diversity in users is present not only because they have different chan…