Author: GuyHaworth
Date: 17:27:20 09/19/03
Go up one level in this thread
The compression algorithm takes blocks of length N bytes (N = 8K in fact) and compresses them by LZ77/Kadatch down to whatever length. The index is therefore "block B starts at position P in the discfile". Last I heard, Rob Hyatt thought 8KB was still ok for best compression-block length. The skill is in choosing which strings are to be chosen to be 'echoed' in the rest of the 8KB block, and how the original strings and their echoes are denoted in the coding. Changing the matching to 'fuzzy matching on broken positions' is apparently do-able within this approach. I guess that if you are programming LZ77 or a variant for fun, there are no patent/licensing problems but otherwise there might be. g
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.