A fast and efficient post BWT-stage for the Burrows-Wheeler compression algorithm

Summary form only given. A new stage for the Burrows-Wheeler compression algorithm (BWCA) is presented, called incremental frequency count (IFC), which, together with a run length encoding (RLE) stage, is located between the Burrows-Wheeler transform (BWT) and the entropy coding (EC) stage of the algorithm. The IFC stage offers a high throughput similar to… CONTINUE READING