Performance versus overhead for fountain codes over Fq

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 term...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2010-02, Vol.14 (2), p.178-180
Main Authors: Liva, G., Paolini, E., Chiani, M.
Format: Article
Language:English
Subjects:
Applied sciences
Broadcasting
Coding, codes
Communication networks
Delay
Encoding
Error probability
Exact sciences and technology
Fountain codes
Galois fields
Information, signal and communications theory
Maximum likelihood decoding
Navigation
Raptor codes
Signal and communications theory
Telecommunications and information theory
Vectors
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2010.02.092080