DocumentCode
2519860
Title
Graph-based LT and raptor codes
Author
Tarable, Alberto ; Benedetto, Sergio
fYear
2008
fDate
6-11 July 2008
Firstpage
2061
Lastpage
2065
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.
Keywords
channel coding; codes; decoding; graph theory; precoding; statistical distributions; AWGN channel; BEC; Raptor code; SNR; graph-based LT code; information bit decoding; noiseless channel coding; optimal degree distribution; performance measure; precoding; AWGN channels; Additive white noise; Decoding; Fading; Gaussian noise; Internet; Linear code; Parity check codes; Performance analysis; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4595352
Filename
4595352
Link To Document