DeepAI AI Chat
Log In Sign Up

Bounds on the Error Probability of Raptor Codes under Maximum Likelihood Decoding

by   Francisco Lázaro, et al.
University of Bologna

In this paper upper bounds on the probability of decoding failure under maximum likelihood decoding are derived for different (non-binary) 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 non-binary but the generator matrix of the LT code has only binary entries, (iv) a combination of (ii) and (iii). The latter construction resembles the RaptorQ construction, 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.


page 1

page 2

page 3

page 4


Parallel Concatenation of Non-Binary Linear Random Fountain Codes with Maximum Distance Separable Codes

The performance and the decoding complexity of a novel coding scheme bas...

Maximum Likelihood Decoding of Convolutionally Coded Noncoherent ASK Signals in AWGN Channels

In this work we develop the maximum likelihood detection (MLD) algorithm...

New LMRD bounds for constant dimension codes and improved constructions

We generalize upper bounds for constant dimension codes containing a lif...

Constructions and bounds for codes with restricted overlaps

Non-overlapping codes have been studied for almost 60 years. In such a c...

Signature codes for weighted binary adder channel and multimedia fingerprinting

In this paper, we study the signature codes for weighted binary adder ch...

Doubly-Exponential Identification via Channels: Code Constructions and Bounds

Consider the identification (ID) via channels problem, where a receiver ...

Bounds and Code Constructions for Partially Defect Memory Cells

This paper considers coding for so-called partially stuck memory cells. ...