Performance versus overhead for fountain codes over Fq
Gianluigi Liva, Enrico Paolini, Marco Chiani · IEEE Communications Letters · 2010
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.