Computer Science – Information Theory
Scientific paper
2008-05-28
Computer Science
Information Theory
15 pages, 3 figures
Scientific paper
An erasure channel with a fixed alphabet size $q$, where $q \gg 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 and linear random codes. It is shown that the envelopes of all these exponents are identical for rates above the critical rate. Noting the optimality of MDS codes, it is concluded that both random codes and linear random codes are exponentially optimal, whether the block sizes is larger or smaller than the alphabet size.
Fashandi Shervan
Gharan Shahab Oveis
Khandani Amir K.
No associations
LandOfFree
Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Coding for the Erasure Channel with Arbitrary Alphabet Size will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-178833