Options
Bounds on the Error Probability of Raptor Codes under Maximum Likelihood Decoding
Publikationstyp
Journal Article
Date Issued
2021-03
Sprache
English
Institut
TORE-URI
Volume
67
Issue
3
Start Page
1537
End Page
1558
Article Number
9312617
Citation
IEEE Transactions on Information Theory 67 (3): 9312617 (2021-03)
Publisher DOI
Scopus ID
ArXiv ID
Peer Reviewed
true
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood decoding are derived for different (nonbinary) Raptor code constructions. In particular four different constructions are considered; (i) the standard Raptor code construction, (ii) a multi-edge type construction, (iii) a construction where the Raptor code is nonbinary but the generator matrix of the LT code has only binary entries, (iv) a combination of (ii) and (iii). The latter construction resembles the one employed by RaptorQ codes, which at the time of writing this article represents the state of the art in fountain codes. The bounds are shown to be tight, and provide an important aid for the design of Raptor codes.
Subjects
Erasure correction
fountain codes
inactivation decoding
LT codes
maximum likelihood decoding
Raptor codes
Computer Science - Information Theory
Computer Science - Information Theory
Mathematics - Information Theory