Author: Sune Fischer
Date: 18:10:53 12/05/01
Go up one level in this thread
On December 05, 2001 at 20:47:56, Sune Fischer wrote: Oh sorry, my fault you did mention that.. >>This leads to the following criterion for picking a set of hashcodes: >>A set of vectors in F2^k is a good set of hash codes if each small subset of >>non-zero vectors is linearly independent. >> >>What is not clear here is the meaning of "small", but we want small to be as big >>as possible. In other words, we consider sets of size up to a certain size as >>small, and if we can make that size bigger, it is better, since this leads to >>unique codes deeper in the tree. >> >>However what is clear is that this quality criterion does not depend on the base >>of the vector space. I.e., if we have a good set and multiply each vector by an >>invertible matrix (in other words, if we rotate the vectors), the obtained set >>will be just as good, since the rotation does not change the linear >>independence. So this is the new problem :) I wonder if Hamming and PRNG _togther_ don't accomplish exactly this. -S.
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.