On Fragmentation for Fountain Codes
Giuliano Garrammone, Francisco Lázaro Blasco · elib (German Aerospace Center) · 2013
We study the performance of selected communication schemes based on fountain codes, under maximum-likelihood (ML) decoding, as a function of the Protocol Data Unit (PDU) erasure probability. In particular, we also consider a scheme that reduces the performance loss due to fragmentation of fountain coding symbols into several PDUs. For the presented schemes, tight upper bounds on the failure probabilities are derived and finite length decoding complexity analysis are provided. Furthermore, we propose an enhanced decoding technique for one of the selected schemes.