Loading...
conference paper
Universal variable-length data compression of binary sources using fountain codes
2004
Proceedings of the IEEE Information Theory Workshop, 2004
This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor concatenates the Burrows-Wheeler block sorting transform (BWT) with a fountain encoder, together with the closed-loop iterative doping algorithm. The decompressor uses a belief propagation algorithm in conjunction with the iterative doping algorithm and the inverse BWT. Linear-time compression/decompression complexity and competitive performance with respect to state-of-the-art compression algorithms are achieved.
Type
conference paper
Authors
Publication date
2004
Published in
Proceedings of the IEEE Information Theory Workshop, 2004
Start page
123
End page
128
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
January 16, 2007
Use this identifier to reference this record