Talk:K-independent hashing

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Definition of k-independence is wrong?

I believe the correct definition would replace the right hand side in the probability statement with:

\prod_{i = 1} ^ {k} Pr_{h \in H} [ h(x_i) = y_i ]

For example, this is what is given in the book by Mitzenmacher and Upfal, 2nd ed, Def 15.1

What is currently defined is called strongly k-universality (Def 15.2 in same book) and k-uniformity in other places. Pashadag (talk) 15:44, 15 January 2025 (UTC)[reply]