Quasi-systematic doped LT codes
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Distributed source coding using raptor codes for hidden Markov sources
IEEE Transactions on Signal Processing
Rateless distributed source code design
Proceedings of the 5th International ICST Mobile Multimedia Communications Conference
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
Cooperation in the MAC channel using frequency division multiplexing
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Jointly decoded raptor codes: analysis and design for the BIAWGN channel
EURASIP Journal on Wireless Communications and Networking
On the design of raptor codes for binary-input Gaussian channels
IEEE Transactions on Communications
Linear LLR approximation for iterative decoding on wireless channels
IEEE Transactions on Communications
Data extraction from wireless sensor networks using distributed fountain codes
IEEE Transactions on Communications
Fountain code design for data multicast with side information
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Generalized MIMO transmit preprocessing using pilot symbol assisted rateless codes
IEEE Transactions on Wireless Communications
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Rateless multilevel coding and applications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Asymptotic analysis of UEP fountain codes over BIAWGN channels
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Trapping sets of fountain codes
IEEE Communications Letters
Global design methods for raptor codes using binary and higher-order modulations
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Cooperation in the low power regime for the MAC using multiplexed rateless codes
IEEE Transactions on Signal Processing
A linear encoding approach to index assignment in lossy source-channel coding
IEEE Transactions on Information Theory
Simple capacity-achieving ensembles of rateless erasure-correcting codes
IEEE Transactions on Communications
Rateless coding for hybrid free-space optical and radio-frequency communication
IEEE Transactions on Wireless Communications
Analysis and optimization of a rateless coded joint relay system
IEEE Transactions on Wireless Communications
LT-codes and phase transitions for mutual information
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
A Reconfigurable TDMP Decoder for Raptor Codes
Journal of Signal Processing Systems
Power-aware rateless codes in mobile wireless communication
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
AirSync: enabling distributed multiuser MIMO with full spatial multiplexing
IEEE/ACM Transactions on Networking (TON)
Hi-index | 755.02 |
In this paper, we will investigate the performance of Raptor codes on arbitrary binary input memoryless symmetric channels (BIMSCs). In doing so, we generalize some of the results that were proved before for the erasure channel. We will generalize the stability condition to the class of Raptor codes. This generalization gives a lower bound on the fraction of output nodes of degree 2 of a Raptor code if the error probability of the belief-propagation decoder converges to zero. Using information-theoretic arguments, we will show that if a sequence of output degree distributions is to achieve the capacity of the underlying channel, then the fraction of nodes of degree 2 in these degree distributions has to converge to a certain quantity depending on the channel. For the class of erasure channels this quantity is independent of the erasure probability of the channel, but for many other classes of BIMSCs, this fraction depends on the particular channel chosen. This result has implications on the "universality" of Raptor codes for classes other than the class of erasure channels, in a sense that will be made more precise in the paper. We will also investigate the performance of specific Raptor codes which are optimized using a more exact version of the Gaussian approximation technique.