Computer Science – Information Theory
Scientific paper
2011-11-14
Computer Science
Information Theory
IEEE International Conference on Communications 2011
Scientific paper
A novel fountain coding scheme has been introduced. The scheme consists of a parallel concatenation of a MDS block code with a LRFC code, both constructed over the same field, $F_q$. The performance of the concatenated fountain coding scheme has been analyzed through derivation of tight bounds on the probability of decoding failure as a function of the overhead. It has been shown how the concatenated scheme performs as well as LRFC codes in channels characterized by high erasure probabilities, whereas they provide failure probabilities lower by several orders of magnitude at moderate/low erasure probabilities.
Blasco Francisco Lazaro
Liva Gianluigi
No associations
LandOfFree
On the Concatenation of Non-Binary Random Linear Fountain Codes with Maximum Distance Separable Codes 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 On the Concatenation of Non-Binary Random Linear Fountain Codes with Maximum Distance Separable Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Concatenation of Non-Binary Random Linear Fountain Codes with Maximum Distance Separable Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-217911