Lines Matching full:compression

37 text compression algorithm, and Huffman coding.  Compression is
105 As with compression, supplying no
120 stdout.  Compression of multiple files 
146 Compression is always performed, even if the compressed 
149 tend to get larger, since the compression mechanism has a constant
199 The complement to \-d: forces compression, regardless of the
220 Keep (don't delete) input files during compression
224 Reduce memory usage, for compression, decompression and testing.  Files
229 During compression, \-s selects a block size of 200k, which limits
230 memory use to around the same figure, at the expense of your compression
239 Verbose mode -- show the compression ratio for each file processed.
268 both the compression ratio achieved, and the amount of memory needed for
269 compression and decompression.  The flags \-1 through \-9
272 compression is read from the header of the compressed file, and
279 Compression and decompression requirements, 
282        Compression:   400k + ( 8 x block size )
288 the compression comes from the first two or three hundred k of block
293 requirement is set at compression time by the choice of block size.
306 since that maximises the compression achieved.  Compression and
320 the Calgary Text Compression Corpus totalling 3,141,622 bytes.  This
321 column gives some feel for how compression varies with block size.
380 The sorting phase of compression gathers together similar strings in the
385 worst-case and average-case compression time is in the region of 10:1.
448 speed up compression.  Bela Lubkin encouraged me to improve the
449 worst-case compression performance.