| M. Schindler. The szip home page, 1997. http://www.compressconsult.com/szip/. |
.... algorithms which use it have surprisingly good performances (the reader may look at the very simple and clean BWT based algorithm described in [26] which outperforms, in terms of compression ratio, the commercial package pkzip) More advanced BWT based compressors, such as bzip2 [34] and szip [33], are among the best compressors currently available. As can be seen from the results reported in [2] BWT based compressors achieve a very good compression ratio using relatively small resources (time and space) Considering that BWT based compressors are still in their infancy, we believe that in ....
....the procedure, that is, in the techniques used for exploiting the skeweness of s = mtf(bw(s) A technique commonly used by BWT compressors is run length encoding which we will discuss in the next section. Move to Front encoding is used by all BWT compressors with the only exceptions of [4] and [33] which use slightly different encoding procedures. 3 BWT compression vs entropy It is generally known that the entropy of a string constitutes a lower bound to how much we can compress it. However, this statement is not precise since there are several definitions of entropy, each one appropriate ....
[Article contains additional citation context not shown here]
M. Schindler. The szip home page, 1997. http://www.compressconsult.com/szip/.
.... algorithms which use it have surprisingly good performances (the reader may look at the very simple and clean BWT based algorithm described in [16] which outperforms, in terms of compression ratio, the commercial package Pkzip) More advanced BWT based compressors, such as Bzip [21] and Szip [20], are among the best compressors currently available. As can be seen from the results reported in [1, 7] BWT based compressors achieve a very good compression ratio using relatively small resources (time and space) Considering that BWT based compressors are still in their infancy, we believe that ....
M. Schindler. The szip home page, 1997. http://www.compressconsult.com/szip/.
....only the new position of the original (unrotated) string after sorting to convert the new string back to the original. More importantly, the new string is sorted by context (reading backwards) so it can be compressed efficiently using order 0 (context insensitive) methods. The szip implementation (Schindler 1997, 1998) achieves the best known compression on the large (2 4 MB) text file portion of the Canterbury corpus (Bell 1998) but is slightly inferior to the best PPM algorithms on the smaller files of the Calgary corpus. Entropy of English If an information source produces messages x with probability P(x) ....
....of one or more nonalphabetic characters to a single space. These were then compressed with the programs listed below. Program Options Version Type Reference compress 4.3d LZ compress, 1990 pkzip 2.04e LZ pkzip, 1993 gzip 9 1.2.4 LZ Gailly, 1993 ha a2 0.98 PPM Hirvola, 1993 szip b41 o0 1. 05xf BW Schindler, 1998 ppmz 9.1 PPM Bloom, 1998 boa m15 0.58 PPM Sutton, 1998 rkive mt3 1.92b1 PPM Taylor, 1998 Compression programs. Program alice alice diff book1 book1 diff size 135,059 135,059 731,361 731,361 compress 3.030 2.892 3.151 3.120 pkzip 2.616 2.565 2.958 2.950 gzip 2.592 2.526 2.926 2.912 ha 1.989 ....
Schindler, Michael (1998), szip homepage, http://www.compressconsult.com/szip/ (Oct 30, 1998).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC