### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | 2004 IEEE Information Theory Workshop - Proceedings, ITW |

Pages | 123-128 |

Number of pages | 6 |

State | Published - Dec 1 2004 |

Event | 2004 IEEE Information Theory Workshop - Proceedings, ITW - San Antonio, TX, United States Duration: Oct 24 2004 → Oct 29 2004 |

### Publication series

Name | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|

### Other

Other | 2004 IEEE Information Theory Workshop - Proceedings, ITW |
---|---|

Country | United States |

City | San Antonio, TX |

Period | 10/24/04 → 10/29/04 |

### All Science Journal Classification (ASJC) codes

- Engineering(all)

## Fingerprint Dive into the research topics of 'Universal variable-length data compression of binary sources using fountain codes'. Together they form a unique fingerprint.

## Cite this

Caire, G., Shamai, S., Shokrollahi, A., & Verdú, S. (2004). Universal variable-length data compression of binary sources using fountain codes. In

*2004 IEEE Information Theory Workshop - Proceedings, ITW*(pp. 123-128). (2004 IEEE Information Theory Workshop - Proceedings, ITW).