Universal variable-length data compression of binary sources using fountain codes

Caire, Giuseppe; Shamai, Shlomo; Shokrollahi; Verdu, Sergio
ITW 2004, IEEE Information Theory Workshop, October 24-29, 2004, San Antonio, USA

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.


DOI
Type:
Conference
City:
San Antonio
Date:
2004-10-29
Department:
Communication systems
Eurecom Ref:
1596
Copyright:
© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:

PERMALINK : https://www.eurecom.fr/publication/1596