2016/04/26 by Francisco Lázaro, Lázaro, Francisco, Gianluigi Liva +5
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1604.07560
Accepted for publication in Proc. of IEEE Globecom 2017
arxiv created 2016/11/18 · arxiv updated 2016/11/21
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.