Sign inSign in
ConceptMathematics

Binary entropy

A measure of uncertainty or average information content of a probability distribution, defined as the negative sum of pilog⁡pip_i \log p_i.
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.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    The binary entropy H2(p)H_2(p) is the function p log₂(1/p) + q log₂(1/q) that measures the uncertainty of a Bernoulli trial with success probability pp.
    • 30:25Binomial Coefficients Asymptotics

Lectures that assume it

1

Connections

7

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

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.