Parsing is introduced as a fourth transformation to the block-sorting (BWT) compression. It is shown that in some situations, the introduction of a simple parsing stage allows improved compression to be obtained compared to an otherwise equivalent character-based BWT implementation. An MTF-like ranking transformation that caters better to large-alphabet situations than does the strict MTF rule used in conventional BWT implementations is also described.
|Number of pages||10|
|Journal||Data Compression Conference Proceedings|
|Publication status||Published - 2001|
|Event||Data Compression Conference - Snowbird, UT, United States|
Duration: 27 Mar 2001 → 29 Mar 2001