Burrows-Wheeler text compression with fountain codes

This paper presents an algorithm in a purely lossless text compression setting based on fountain codes and the Burrows-Wheeler transform (BWT). The scheme consists of five stages, each of which is briefly described in the paper. The algorithm offers encouraging compression rate performance for large files. A summary of the results of the proposed scheme and other compression schemes is provided.


Published in:
Proceedings of the Data Compression Conference, DCC 2006, 28-30
Year:
2006
Keywords:
Laboratories:




 Record created 2007-01-16, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)