A Mathematical Theory of Communication
Shannon, 1948, A Mathematical Theory of Communication (Bell System Technical Journal)
Subscriber deck — free during early access
2 cards in “20 Entropy of a continuous distribution” · whole deck
20 Entropy of a continuous distribution
- How is entropy defined for a continuous distribution, and how does it differ from the discrete case?\(H = -\int p(x) \log p(x)\,dx\). Unlike discrete entropy it is relative to the coordinate system (it changes by the expected log Jacobian under a change of variables) and can be negative; rates and capacities, being differences of entropies, are unaffected.
- Shannon, 1948, A Mathematical Theory of Communication (Bell System Technical Journal), §20
- Which distribution maximizes entropy for a fixed standard deviation \(\sigma\), and what is its entropy?The Gaussian, with \(H = \log \sqrt{2\pi e}\,\sigma\). (On a half line with fixed mean \(a\), the exponential, with \(H = \log ea\).)
- Shannon, 1948, A Mathematical Theory of Communication (Bell System Technical Journal), §20
Source
- Claude E. Shannon. 1948. A Mathematical Theory of Communication. In Bell System Technical Journal, pp. 379–423, 623–656. doi:10.1002/j.1538-7305.1948.tb01338.x