Lines Matching full:compression
36 text compression algorithm, and Huffman coding. Compression is
104 As with compression, supplying no
119 stdout. Compression of multiple files
145 Compression is always performed, even if the compressed
148 tend to get larger, since the compression mechanism has a constant
198 The complement to \-d: forces compression, regardless of the
219 Keep (don't delete) input files during compression
223 Reduce memory usage, for compression, decompression and testing. Files
228 During compression, \-s selects a block size of 200k, which limits
229 memory use to around the same figure, at the expense of your compression
238 Verbose mode -- show the compression ratio for each file processed.
267 both the compression ratio achieved, and the amount of memory needed for
268 compression and decompression. The flags \-1 through \-9
271 compression is read from the header of the compressed file, and
278 Compression and decompression requirements,
281 Compression: 400k + ( 8 x block size )
287 the compression comes from the first two or three hundred k of block
292 requirement is set at compression time by the choice of block size.
305 since that maximises the compression achieved. Compression and
319 the Calgary Text Compression Corpus totalling 3,141,622 bytes. This
320 column gives some feel for how compression varies with block size.
379 The sorting phase of compression gathers together similar strings in the
384 worst-case and average-case compression time is in the region of 10:1.
447 speed up compression. Bela Lubkin encouraged me to improve the
448 worst-case compression performance.