Good Hashing:Universal Hash Function
Parameterized by prime size and vector:
a = <a0 a1 … ar> where 0 <= ai < size
Represent each key as r + 1 integers where ki < size
- size = 11, key = 39752 ==> ɛ,9,7,5,2>
- size = 29, key = “hello world” ==> ɠ,5,12,12,15,23,15,18,12,4>
-
ha(k) =