Papalocal
Loading…
Papalocal · Things
Work

information entropy

Information entropy is an expected value of the amount of information delivered by a message.

All 2 facts, and where they come from

Facts

2 facts · 0 confirmed by two sources · 0 cited · 2 from one source

What it is
mathematical expression One source
mathematical concept One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 16, 2026 · revision 2560987522
Described as
expected value of the amount of information delivered by a message
Other names
entropy, Shannon entropy, average information content, negentropy
What it is
mathematical expression; mathematical concept
Wikipedias with a page
49

Wikidata item Q204570 (wikidata.org/wiki/Q204570), public domain (CC0). Copied 2026-11-16.

What Wikipedia says · copied November 16, 2026 · revision 1384576852

In information theory, the entropy of a random variable quantifies the average level of uncertainty or information associated with the variable's potential states or possible outcomes. This measures the expected amount of information needed to describe the state of the variable, considering the distribution of probabilities across all potential states. Given a discrete random variable X, which may be any member x within the set 𝒳 and is distributed according to p:𝒳→[0,1], the entropy is
H(X):=−∑x∈𝒳p(x)log⁡p(x),
where Σ denotes the sum over the variable's possible values. The choice of base for log, the logarithm, varies for different applications. Base 2 gives the unit of bits (or "shannons"), while base e gives "natural units" nat, and base 10 gives units of "dits", "bans", or "hartleys". An equivalent definition of entropy is the expected value of the self-information of a variable.
The concept of information entropy was introduced by Claude Shannon in his 1948 paper "A Mathematical Theory of Communication", and is also referred to as Shannon entropy. Shannon's theory defines a data communication system composed of five elements: an information source, a transmitter, a communication channel, a receiver, and a destination. The "fundamental problem of communication" – as expressed by Shannon – is for the receiver to be able to identify what data was generated by the source, based on the signal it receives through the channel. Shannon considered various ways to encode, compress, and transmit messages from a data source, and proved in his source coding theorem that the entropy represents an absolute mathematical limit on how well data from the source can be losslessly compressed onto a perfectly noiseless channel. Shannon strengthened this result considerably for noisy channels in his noisy-channel coding theorem.
Entropy in information theory is directly analogous to the entropy in statistical thermodynamics. The analogy results when the values of the random variable designate energies of microstates, so Gibbs's formula for the entropy is formally identical to Shannon's formula. Entropy has relevance to other areas of mathematics such as combinatorics and machine learning. The definition can be derived from a set of axioms establishing that entropy should be a measure of how informative the average outcome of a variable is. For a continuous random variable, differential entropy is analogous to entropy. The definition 𝔼[−log⁡p(X)] generalizes the above.

From the Wikipedia article “Entropy (information theory)” (en.wikipedia.org/wiki/Entropy_(information_theory)), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it