Sign inSign in

K-wise independence

A property where for any k distinct output positions, the joint probability distribution equals the uniform distribution of k bits.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Graduate

    A property of a hash family where any subset of k keys behave as if they are independently hashed, with collision probability bounded by O(1/mk)O(1/m^k).

Connections

7

The lectures that define it or assume it, and the concepts next to it.

Concepts5

Lectures2

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.