ocr: This figurc gives a snapshot of the LZRW1 comprossion algorithm in execution. The horizontal bar represents the input block (in memory) which is used directly as a read-only data structure. The hash table maps thrce-byte kcys to pointers that Call point anywhere in memory, but which are likely to point to a recent occurrence of the key in the input already scanned (the history). At each step the hash table is used to map the first three bytes of the Ziv (defined to be the first sixteen bytos of the remaining part of message) to such a pointer. To kecp the hash table up to datc, the hash table ...
