Throughput of Rateless Codes Over Broadcast Erasure Channels
In this paper, the authors characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. They assume that the underlying channel is a Markov modulated erasure channel that is i.i.d. across users, but can be correlated in time. They characterize the system throughput asymptotically in n. Specifically, they explicitly show how the throughput behaves for different values of the coding block size K as a function of n, as n approaches infinity. Under the more restrictive assumption of memoryless channels, they are able to provide a lower bound on the maximum achievable throughput for any finite values of K and n.