Sciweavers

Share
CORR
2008
Springer

Coding over an Erasure Channel with a Large Alphabet Size

8 years 2 months ago
Coding over an Erasure Channel with a Large Alphabet Size
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 achieve the minimum probability of error (assuming maximum likelihood decoding). Assuming a memoryless erasure channel, the error exponent of MDS codes are compared with that of random codes. It is shown that the envelopes of these two exponents are identical for rates above the critical rate. Noting the optimality of MDS codes, it is concluded that random coding is exponentially optimal as long as the block size N satisfies
Shervan Fashandi, Shahab Oveis Gharan, Amir K. Kha
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Shervan Fashandi, Shahab Oveis Gharan, Amir K. Khandani
Comments (0)
books