This paper deals with LT and raptor codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. The performance measure for such family of codes is the efficiency, i.e., the average amount of redundancy needed to decode the information bits. We consider the new class of graph-based LT and raptor codes, we analyze their efficiency and we show that the optimal degree distribution of the LT code depends on the rate of the precoder.
Graph-based LT and Raptor codes
Tarable Alberto;
2008
Abstract
This paper deals with LT and raptor codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. The performance measure for such family of codes is the efficiency, i.e., the average amount of redundancy needed to decode the information bits. We consider the new class of graph-based LT and raptor codes, we analyze their efficiency and we show that the optimal degree distribution of the LT code depends on the rate of the precoder.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
