Performance versus overhead for fountain codes over Fq

IEEE Communications Letters

Volumn 14, Issue 2, 2010, Pages 178-180

  Liva, Gianluigi ^a   Paolini, Enrico ^b   Chiani, Marco ^b  

^a GERMAN AEROSPACE CENTER DLR   (Germany)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Fountain codes; Maximum likelihood decoding; Raptor codes

Indexed keywords

BLOCK SIZES; DECODING FAILURE; ENCODING AND DECODING; FOUNTAIN CODES; GALOIS FIELDS; HIGHER ORDER; MAXIMUM LIKELIHOOD DECODING; NON-BINARY; RAPTOR CODES; UPPER AND LOWER BOUNDS;

CHANNEL CAPACITY; DECODING; FOUNTAINS;

MAXIMUM LIKELIHOOD;

EID: 76749163740     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2010.02.092080     Document Type: Article

References (8)

1. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," SIGCOMM Comput. Commun. Rev., vol.28, no.4, pp. 56-67, Oct. 1998.
2. M. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol.52, no.6, pp. 2551-2567, June 2006.
3. R. Lidl and H. Niederreiter, Finite Fields. Cambridge, UK: Cambridge Univ. Press, 1997.
4. E. R. Berlekamp, "The technology of error-correcting codes," Proc. IEEE, vol.68, no.5, pp. 564-593, May 1980.
5. M. Luby, "LT codes," in Proc. 43rd Annual IEEE Symp. on Foundations of Computer Science, Nov. 2002, pp. 271-282.
6. 3GPP TS 26.346 V9.0.0, "Technical specification group services and system aspects; multimedia broadcast/multicast service (MBMS); protocols and codecs (Release 8)," Oct. 2009.
7. D. Burshtein and G. Miller, "An efficient maximum likelihood decoding of LDPC codes over the binary erasure channel," IEEE Trans Inf. Theory, vol.50, no.11, pp. 2837-2844, Nov. 2004.
8. E. Paolini, G. Liva, B. Matuz, and M. Chiani, "Pivoting algorithms for maximum-likelihood decoding of LDPC codes over erasure channels," in Proc. 2009 IEEE Global Telecommunications Conference, Honolulu, HI, USA, Nov. 2009.