WikiRNG
Rolled Roll your own

Gibbs' inequality

Statement in information theory

In information theory, Gibbs' inequality is a statement about the information entropy of a discrete probability distribution. Several other bounds on the entropy of probability distributions are derived from Gibbs' inequality, including Fano's inequality. It was first presented by J. Willard Gibbs in the 19th century.

Read it on Wikipedia · Version rolled

ObscureTop 21%
95,377SP

Badges18 earned

  1. Problem SetObscure+49,647 SP
    Has 20+ math formulas. · 53 formulas
  2. EquationObscure+17,515 SP
    Has a math formula.
  3. Fair TradeObscure+12,853 SP
    Exactly as many links in as links out (10+). · 14 in, 14 out
  1. All TalkNotable+5,368 SP
    Its talk page is bigger than the article. · Talk page 12,734 bytes, article 6,003
  2. ApostropheNotable+3,117 SP
    Title has an apostrophe.
  3. Footnote to a FootnoteNotable+1,569 SP
    Has explanatory notes. · 2 notes
  4. Walled GardenNotable+1,147 SP
    No external links.
Basic11
rolled by koopa4life

It was a statement on probability.

koopa4life rolled Gibbs' inequality | WikiRNG