Bounds on the error probability of raptor codes
Publikationstyp
Conference Paper
Date Issued
2016-12
Sprache
English
Institut
TORE-URI
Article Number
7841639
Citation
IEEE Global Communications Conference, GLOBECOM 2016
Contribution to Conference
Publisher DOI
Scopus ID
Publisher
IEEE
ISBN of container
978-1-5090-1328-9
978-1-5090-1327-2
978-1-5090-1329-6
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.
DDC Class
600: Technology