  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.
