|Publisher DOI:||10.1109/GLOCOM.2016.7841639||Title:||Bounds on the error probability of raptor codes||Language:||English||Authors:||Lazaro, Francisco
|Issue Date:||2016||Source:||2016 IEEE Global Communications Conference, GLOBECOM: 7841639 (2016)||Abstract (english):||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.||Conference:||IEEE Global Communications Conference, GLOBECOM (2016)||URI:||http://hdl.handle.net/11420/3388||ISBN:||978-150901328-9||Institute:||Nachrichtentechnik E-8||Type:||InProceedings (Aufsatz / Paper einer Konferenz etc.)|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Sep 27, 2020
Add Files to Item
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.