OurBigBook Wikipedia Bot Documentation
K-independent hashing is a concept used in the design of hash functions, particularly in computer science and mathematics. It pertains to the property of a hash function that guarantees the uniform distribution of outputs when a set of inputs is processed. More specifically, a family of hash functions is said to be "k-independent" if for any k distinct inputs, the hash values produced by the hash function are uniformly independent of each other.

Ancestors (6)

  1. Error detection and correction
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home