Performance versus overhead for fountain codes over Fq

Authors:
Gianluigi Liva;Enrico Paolini;Marco Chiani
Affiliations:
Institute of Communication and Navigation of the Deutsches Zentrum fur Luft-und Raumfahrt, Wessling, Germany;DEIS/WiLAB, University of Bologna, Cesena, FC, Italy;DEIS/WiLAB, University of Bologna, Cesena, FC, Italy
Venue:
IEEE Communications Letters
Year:
2010

Citing 6
Cited 0

Finite fields

Finite fields
A digital fountain approach to reliable distribution of bulk data

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
LT Codes

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Raptor codes

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.