Skip to content

FOLLOW AN IDEA

Shannon entropy

Entropy is expected negative log probability for a discrete distribution.

H(X)=−∑xp(x)log⁡p(x)H(X)=-\sum_x p(x)\log p(x)

Explore concept graph · Explore connected videos

Different ways to understand it

No reviewed video yet. Explore the concept in a map or suggest a resource. Suggest a video

More concepts to explore

  • Conditional entropy

    Conditional entropy averages remaining uncertainty after another variable is observed.

  • Probability

    A probability measure assigns nonnegative weights to events, with total weight one and countable additivity on disjoint events.

  • Relative entropy

    KL divergence compares distributions and is generally asymmetric, with support conditions affecting finiteness.

  • Source coding

    Source coding represents messages efficiently, with entropy constraining lossless average code length.

  • Channel capacity

    Capacity bounds achievable reliable information rates for a specified channel model.

Back to the complete concept index →

Knowledge connections

Appears in these maps

LEARNING MAP

Information and Coding Theory

Explore information measures; compression and channels; error correction. Concepts and connections are available independently of video coverage.

Scope reference