30 search results - page 1 / 6 » Coding over an Erasure Channel with a Large Alphabet Size |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
MOBIHOC
2012
ACM
11 years 6 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...
CORR
2008
Springer
13 years 3 months ago
2008
Springer
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
INFOCOM
2008
IEEE
13 years 10 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...
ICMCS
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper proposes a novel error-resilient packet video coding method which is designed to operate on unreliable IP networks suffering from large bursts of packet losses. The mai...