3 hash functions to best hash sliding window strings for a bloom filter with minimum collisions
<p>I need 3 hash functions to hash strings of a sliding window moving over a text, to be used later to search within a bloom vector. I'm using C# in my programming</p>

<p>I read something about rolling hash functions and cyclic polynomials, they are used for sliding window applications. But really, I did not find any codes, they are just descriptions</p>

<p>So please, if anyone have any idea about 3 best C# hash functions to use with sliding window strings of fixed size (5-char), that consume less time and have minimum number of collisions, either they are rolling hash functions or others, please help me with some C# codes or links to hash functions names  </p>

<p>The strings are all hex, I mean consist of (0-9) and (A-F) capital letters only, along with the dash character (-) ... for example</p>

<p>my string can be AB-2C-65-ED-65</p>

<p>Duaa</p>
