Add to ORKGIn this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are considered. An expression for the average distance spectrum is derived and this expression is used to obtain the asymptotic exponent of the weight distribution. The asymptotic growth rate analysis is then exploited to develop a necessary and sufficient condition under which the fixed-rate Raptor code ensemble exhibits a strictly positive typical minimum distance
The bit-error-rate expressions of nonsystematic Raptor (NR) codes and systematic Raptor (SR) codes o...
In this paper, the asymptotic growth rate of the weight distribution of irregular doubly generalized...
[[abstract]]Distance properties of trellis codes are of great importance for performance evaluation....
In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are consider...
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expr...
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...
In this paper, we revisit the design of Raptor codes for binary input additive white Gaussian noise ...
In this thesis, we investigate the optimization of Raptor codes for various channels of interest in ...
Abstract—In this paper, we discuss the rate splitting issue for the design of finite length Raptor c...
We consider weighted nonbinary repeat multiple- accumulate (WNRMA) code ensembles obtained from the ...
Abstract—In this paper we consider the ensemble of codes formed by a serial concatenation of a repet...
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
In this paper we describe some practical aspects of the design process of good Raptor codes for fini...
The bit-error-rate expressions of nonsystematic Raptor (NR) codes and systematic Raptor (SR) codes o...
In this paper, the asymptotic growth rate of the weight distribution of irregular doubly generalized...
[[abstract]]Distance properties of trellis codes are of great importance for performance evaluation....
In this paper Raptor code ensembles with linear random precodes in a fixed-rate setting are consider...
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expr...
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...
In this paper, we revisit the design of Raptor codes for binary input additive white Gaussian noise ...
In this thesis, we investigate the optimization of Raptor codes for various channels of interest in ...
Abstract—In this paper, we discuss the rate splitting issue for the design of finite length Raptor c...
We consider weighted nonbinary repeat multiple- accumulate (WNRMA) code ensembles obtained from the ...
Abstract—In this paper we consider the ensemble of codes formed by a serial concatenation of a repet...
In this paper upper and lower bounds on the probability of decoding failure under maximum likelihood...
LT-codes are a new class of codes introduced by Luby for the purpose of scalable and fault-tolerant ...
In this paper we describe some practical aspects of the design process of good Raptor codes for fini...
The bit-error-rate expressions of nonsystematic Raptor (NR) codes and systematic Raptor (SR) codes o...
In this paper, the asymptotic growth rate of the weight distribution of irregular doubly generalized...
[[abstract]]Distance properties of trellis codes are of great importance for performance evaluation....