Francisco Lázaro, Gianluigi Liva, Enrico Paolini, Gerhard Bauch
Published 2016-04-26Version 1
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability of decoding failure is derived using the weight enumerator of the outer code, or its expected weight enumerator if the outer code is drawn randomly from some ensemble of codes. The bound is shown to be tight by means of simulations. This bound provides a new insight into Raptor codes since it shows how Raptor codes can be analyzed similarly to a classical fixed-rate serial concatenation.
Comments: Submitted to Globecom 2016
Statistical Hypothesis Testing and Lower Bounds to the Error Probability
On Achievable Rates of AWGN Energy-Harvesting Channels with Block Energy Arrival and Non-Vanishing Error Probabilities
On exact asymptotics of the error probability in channel coding: symmetric channels
![QR code for arXiv:1604.07560 [cs.IT]](http://oss.arxitics.com/images/favicon.svg)