Abstract:Digital Fountain is a packet oriented FEC technology for erasure channels. And the performance of fountain codes is limited by the distribution of stopping sets. In the paper, a pair of bounds was proposed to estimate the decoding failure probability of finite length fountain codes. And a search algorithm of low complexity was presented to get the stopping set distribution. The comparisons show that the upper and lower bounds are very close to the simulation results.