27 search results - page 1 / 6 » Throughput of rateless codes over broadcast erasure channels |
MOBIHOC
2012
ACM
11 years 9 months ago
2012
ACM
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, we concentrate on opportunistic scheduling for multicast information. We pose the problem as a multicast throughput optimization problem. As a solution we presen...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
— The tolerable packet-loss ratio of an Internet Protocol (IP) based wireless networks varies according to the specific services considered. File transfer for example must be er...
ICMCS
2005
IEEE
14 years 15 days ago
2005
IEEE
We consider wireless broadcasting of multimedia content to allow asynchronous media access. Receivers subscribe at any time to the ongoing broadcast session, but are still able to...
ICC
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—Rateless coding ensures reliability by providing everincreasing redundancy, traditionally at the packet level (i.e. the application layer) through erasure coding. This p...