461 citations · 1.3k across the 28 of their papers we have counts for
5 papers · 2 filters
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…
Decoding Complexity of Irregular LDGM-LDPC Codes Over the BISOM Channels
Manik Raina, Predrag Spasojevic
An irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly \emph{punctured} output-bits. It is shown that the LDGM-LDPC codes achieve rates arbitrarily…
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…
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…
Doped Fountain Coding for Minimum Delay Data Collection in Circular Networks
Silvija Kokalj-Filipovic, Predrag Spasojevic, Emina Soljanin
This paper studies decentralized, Fountain and network-coding based strategies for facilitating data collection in circular wireless sensor networks, which rely on the stochastic d…