Abstract—In this paper, we discuss the rate splitting issue for the design of finite length Raptor codes, in a joint decoding framework. We show that the choice of a rate lower than usually proposed for the precode enables to design Raptor codes that perform well at small lengths, with almost no asymptotic loss. We show in particular that the error floor can be greatly reduced by properly choosing the rate splitting between the precode and the LT code. Those behaviors are demonstrated both on the BEC and the BIAWGN channel. I
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are consider...
In this paper we describe some practical aspects of the design process of good Raptor codes for fini...
Abstract—In this paper, we present an analytical analysis of the convergence of raptor codes under j...
In this thesis, we investigate the optimization of Raptor codes for various channels of interest in ...
In this paper, we revisit the design of Raptor codes for binary input additive white Gaussian noise ...
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expr...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
Abstract—LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-...
Fountain codes are a class of rateless codes with two interesting properties, first, they can genera...
Raptor codes are a class of rateless codes originally designed for binary erasure channels. This pap...
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability...
© 2016 IEEE. In this paper, we analyze the maximum likelihood decoding performance of Raptor codes w...
Based on recent results on the performance of LT codes under inactivation decoding, we show how to d...
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are consider...
In this paper we describe some practical aspects of the design process of good Raptor codes for fini...
Abstract—In this paper, we present an analytical analysis of the convergence of raptor codes under j...
In this thesis, we investigate the optimization of Raptor codes for various channels of interest in ...
In this paper, we revisit the design of Raptor codes for binary input additive white Gaussian noise ...
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expr...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
Abstract—LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-...
Fountain codes are a class of rateless codes with two interesting properties, first, they can genera...
Raptor codes are a class of rateless codes originally designed for binary erasure channels. This pap...
In this paper q-ary Raptor codes under ML decoding are considered. An upper bound on the probability...
© 2016 IEEE. In this paper, we analyze the maximum likelihood decoding performance of Raptor codes w...
Based on recent results on the performance of LT codes under inactivation decoding, we show how to d...
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
As the most advanced rateless fountain codes, Systematic Raptor codes has been adopted by the 3GPP s...
In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are consider...