DocumentCode :
1400603
Title :
Performance versus overhead for fountain codes over Fq
Author :
Liva, Gianluigi ; Paolini, Enrico ; Chiani, Marco
Author_Institution :
Inst. of Commun. & Navig., Deutsches Zentrum fur Luft- und Raumfahrt (DLR), Wessling, Germany
Volume :
14
Issue :
2
fYear :
2010
fDate :
2/1/2010 12:00:00 AM
Firstpage :
178
Lastpage :
180
Abstract :
Fountain codes for packet erasure recovery are investigated over Galois fields of order q ¿ 2. It is shown through development of tight upper and lower bounds on the decoding failure probability under maximum likelihood decoding, that the adoption of higher order Galois fields is beneficial, in terms of performance, for linear random fountain codes. Moreover, it is illustrated how Raptor codes can provide performances very close to those of random fountain codes, with an affordable encoding and decoding complexity. Non-binary Raptor codes turn out to represent an appealing option for applications requiring severe constraints in terms of performance versus overhead, especially for small source block sizes.
Keywords :
linear codes; maximum likelihood decoding; probability; random codes; Galois fields; decoding complexity; decoding failure probability; linear random fountain codes; lower bounds; maximum likelihood decoding; nonbinary Raptor codes; packet erasure recovery; upper bounds; Broadcasting; Communication networks; Delay; Encoding; Error probability; Galois fields; Maximum likelihood decoding; Navigation; Vectors; Fountain codes, Raptor codes, maximum likelihood decoding;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2010.02.092080
Filename :
5403626
Link To Document :
بازگشت