
of data, say N bytes, for compression. Normally, the value of N is one of 512,
1024 or 2048. Every time a string in the N bytes is replicated it is replaced by a
pointer-length pair as described above. After compression of N bytes of data,
the algorithm searches for the string starting at the next unprocessed byte in the
N bytes previously compressed. If the longest match found has a length of zero
or one, it represents the first byte in the unprocessed string as a raw character
as mentioned previously. If, on the other hand, the length of the matching string
is greater than one, the compression algorithm will represent the string using a
pointer-length ...