Skip to main content

Message vs information; entropy

Short answer

A message is a physical symbol, while information measures uncertainty removal: I = log2(1/p) bits. Entropy H = -∑ p log2 p is the average information per message. Thus, a source emitting messages with probabilities yields an expected information content given by its entropy.

Differentiate between message and information. Relate the message, the entropy and the information.

A message is the actual symbol or sequence of symbols sent by the source (a letter, a word, a sample value). Information is the measure of the uncertainty removed when that message is received; it depends only on how probable the message is, not on its meaning.

Message vs information

MessageInformation
Physical symbol(s) produced by the sourceQuantity carried by the message
Has content and meaningIndependent of meaning
Counted in symbols, words or samplesMeasured in bits: I=log⁡2(1/p)I = \log_2(1/p)
A sure (expected) message is still a messageA sure message carries zero information
Example: "Sun rises in the east"Almost 0 bits, since p≈1p \approx 1

Relation between message, information and entropy

  1. Information of one message. If message mkm_k occurs with probability pkp_k, its information content is
Ik=log⁡21pk bitsI_k = \log_2\frac{1}{p_k}\ \text{bits}

Properties: Ik≥0I_k \ge 0; Ik=0I_k = 0 for pk=1p_k = 1; Ik>IjI_k > I_j if pk<pjp_k < p_j; for independent messages I(mkmj)=Ik+IjI(m_k m_j) = I_k + I_j.

  1. Entropy = average information per message. A source emits MM different messages with different information. In a long sequence of NN messages, mkm_k appears about NpkN p_k times, so the total information is
Itotal=∑k=1MNpklog⁡21pkI_{total} = \sum_{k=1}^{M} N p_k \log_2\frac{1}{p_k}

Dividing by NN:

H=ItotalN=∑k=1Mpklog⁡21pk bits/messageH = \frac{I_{total}}{N} = \sum_{k=1}^{M} p_k \log_2\frac{1}{p_k}\ \text{bits/message}

So entropy is the expected (mean) value of the information, H=E[Ik]H = E[I_k]. It lies in 0≤H≤log⁡2M0 \le H \le \log_2 M, with the maximum when all messages are equally likely.

  1. Information rate. If the source sends rr messages per second, the information rate is R=rHR = rH bits/s.

Example

A source sends four messages with probabilities 12,14,18,18\tfrac12, \tfrac14, \tfrac18, \tfrac18.

Messagepkp_kIkI_k (bits)
m1m_11/21
m2m_21/42
m3m_31/83
m4m_41/83
H=12(1)+14(2)+18(3)+18(3)=1.75 bits/messageH = \tfrac12(1)+\tfrac14(2)+\tfrac18(3)+\tfrac18(3) = 1.75\ \text{bits/message}

A message sequence of 1000 symbols therefore carries about 1000×1.75=17501000 \times 1.75 = 1750 bits of information, although each individual message carries 1, 2 or 3 bits. The message is the carrier; information is what it carries; entropy is the average amount carried per message.

✓ Answer checked by Claude Opus 5.5 (high effort)

All Communication Systems chapter 6 questions →