Shannon's source coding theorem

In information theory, Shannon's source coding theorem (or noiseless coding theorem) establishes the statistical limits to possible data compression for data whose source is an independent identically-distributed random variable, and the operational meaning of the Shannon entropy.

Named after Claude Shannon, the source coding theorem shows that, in the limit, as the length of a stream of independent and identically-distributed random variable (i.i.d.) data tends to infinity, it is impossible to compress such data such that the code rate (average number of bits per symbol) is less than the Shannon entropy of the source, without it being virtually certain that information will be lost. However it is possible to get the code rate arbitrarily close to the Shannon entropy, with negligible probability of loss.

The source coding theorem for symbol codes places an upper and a lower bound on the minimal possible expected length of codewords as a function of the entropy of the input word (which is viewed as a random variable) and of the size of the target alphabet.

Note that, for data that exhibits more dependencies (whose source is not an i.i.d. random variable), the Kolmogorov complexity, which quantifies the minimal description length of an object, is more suitable to describe the limits of data compression. Shannon entropy takes into account only frequency regularities while Kolmogorov complexity takes into account all algorithmic regularities, so in general the latter is smaller. On the other hand, if an object is generated by a random process in such a way that it has only frequency regularities, entropy is close to complexity with high probability (Shen et al. 2017).

Statements

Source coding is a mapping from (a sequence of) symbols from an information source to a sequence of alphabet symbols (usually bits) such that the source symbols can be exactly recovered from the alphabet symbols (lossless source coding) or recovered within some distortion (lossy source coding). This is one approach to data compression.

Source coding theorem

In information theory, the source coding theorem (Shannon 1948) informally states that (MacKay 2003, pg. 81, Cover 2006, Chapter 5):

Template:Mvar i.i.d. random variables each with entropy H(X) can be compressed into more than N H(X) bits with negligible risk of information loss, as N → ∞; but conversely, if they are compressed into fewer than N H(X) bits it is virtually certain that information will be lost.

The coded sequence of length

$NH(X)$

represents the compressed message in a biunivocal way, under the assumption that the decoder knows the source. From a practical point of view, this assumption is not always true. Consequently, when the entropy encoding is applied, the transmitted message may need to include information characterizing the source, usually inserted at the beginning of the transmitted message.

Source coding theorem for symbol codes

Let Σ₁, Σ₂ denote two finite alphabets and let Σ and Σ denote the set of all finite words from those alphabets (respectively).

Suppose that Template:Mvar is a random variable taking values in Σ₁ and let  f  be a uniquely decodable code from Σ to Σ where |Σ₂| = a. Let Template:Mvar denote the random variable given by the length of codeword  f (X).

If  f  is optimal in the sense that it has the minimal expected word length for Template:Mvar, then (Shannon 1948):

$\frac{H(X)}{{\log }_{2}a}\le \mathbb{𝔼}[S]<\frac{H(X)}{{\log }_{2}a}+1$

Where $\mathbb{𝔼}$ denotes the expected value operator.

Proof: source coding theorem

Given Template:Mvar is an i.i.d. source, its time series X₁, ..., X_n is i.i.d. with entropy H(X) in the discrete-valued case and differential entropy in the continuous-valued case. The Source coding theorem states that for any ε > 0, i.e. for any rate H(X) + ε larger than the entropy of the source, there is large enough Template:Mvar and an encoder that takes Template:Mvar i.i.d. repetition of the source, X^1:n, and maps it to n(H(X) + ε) binary bits such that the source symbols X^1:n are recoverable from the binary bits with probability of at least 1 − ε.

Proof of Achievability. Fix some ε > 0, and let

$p(x_1,\dots ,x_n)=\mathrm{Pr}[X_1=x_1,\cdots ,X_n=x_n].$

The typical set, A, is defined as follows:

$A_n^{\epsilon }=\{(x_1,\cdots ,x_n):|-\frac{1}{n}\log p(x_1,\cdots ,x_n)-H_n(X)|<\epsilon \}.$

The asymptotic equipartition property (AEP) shows that for large enough Template:Mvar, the probability that a sequence generated by the source lies in the typical set, A, as defined approaches one. In particular, for sufficiently large Template:Mvar, $P((X_1,X_2,\cdots ,X_n)\in A_n^{\epsilon })$ can be made arbitrarily close to 1, and specifically, greater than $1-\epsilon$ (See AEP for a proof).

The definition of typical sets implies that those sequences that lie in the typical set satisfy:

$2^{-n(H(X)+\epsilon )}\le p(x_1,\cdots ,x_n)\le 2^{-n(H(X)-\epsilon )}$

• The probability of a sequence $(X_1,X_2,\cdots X_n)$ being drawn from A is greater than 1 − ε.
• $\left|A_n^{\epsilon }\right|\le 2^{n(H(X)+\epsilon )}$, which follows from the left hand side (lower bound) for $p(x_1,x_2,\cdots x_n)$.
• $\left|A_n^{\epsilon }\right|\ge (1-\epsilon )2^{n(H(X)-\epsilon )}$, which follows from upper bound for $p(x_1,x_2,\cdots x_n)$ and the lower bound on the total probability of the whole set A.

Since $\left|A_n^{\epsilon }\right|\le 2^{n(H(X)+\epsilon )},n(H(X)+\epsilon )$ bits are enough to point to any string in this set.

The encoding algorithm: the encoder checks if the input sequence lies within the typical set; if yes, it outputs the index of the input sequence within the typical set; if not, the encoder outputs an arbitrary n(H(X) + ε) digit number. As long as the input sequence lies within the typical set (with probability at least 1 − ε), the encoder does not make any error. So, the probability of error of the encoder is bounded above by Template:Mvar.

Proof of converse: the converse is proved by showing that any set of size smaller than A (in the sense of exponent) would cover a set of probability bounded away from 1.

Proof: Source coding theorem for symbol codes

For 1 ≤ i ≤ n let s_i denote the word length of each possible x_i. Define $q_i=a^{-s_i}/C$, where Template:Mvar is chosen so that q₁ + ... + q_n = 1. Then

$\begin{array}{rl}H(X)& =-\sum _{i=1}^n{p}_i{\log }_2{p}_i\\ & \le -\sum _{i=1}^n{p}_i{\log }_2{q}_i\\ & =-\sum _{i=1}^n{p}_i{\log }_2{a}^{-s_i}+\sum _{i=1}^n{p}_i{\log }_{2}C\\ & =-\sum _{i=1}^n{p}_i{\log }_2{a}^{-s_i}+{\log }_{2}C\\ & \le -\sum _{i=1}^n-s_i{p}_i{\log }_{2}a\\ & =\mathbb{𝔼}S{\log }_{2}a\\ \end{array}$

where the second line follows from Gibbs' inequality and the fifth line follows from Kraft's inequality:

$C=\sum _{i=1}^n{a}^{-s_i}\le 1$

so log C ≤ 0.

For the second inequality we may set

$s_i=\lceil -{\log }_a{p}_i\rceil$

so that

$-{\log }_a{p}_i\le s_i<-{\log }_a{p}_i+1$

and so

$a^{-s_i}\le p_i$

and

$\sum a^{-s_i}\le \sum p_i=1$

and so by Kraft's inequality there exists a prefix-free code having those word lengths. Thus the minimal Template:Mvar satisfies

$\begin{array}{rl}\mathbb{𝔼}S& =\sum p_i{s}_i\\ & <\sum p_i(-{\log }_a{p}_i+1)\\ & =\sum -p_i\frac{{\log }_2{p}_i}{{\log }_{2}a}+1\\ & =\frac{H(X)}{{\log }_{2}a}+1\\ \end{array}$

Extension to non-stationary independent sources

Fixed rate lossless source coding for discrete time non-stationary independent sources

Define typical set A as:

$A_n^{\epsilon }=\{x_1^n:|-\frac{1}{n}\log p(X_1,\cdots ,X_n)-\overline{H_n}(X)|<\epsilon \}.$

Then, for given δ > 0, for Template:Mvar large enough, Pr(A) > 1 − δ. Now we just encode the sequences in the typical set, and usual methods in source coding show that the cardinality of this set is smaller than $2^{n(\overline{H_n}(X)+\epsilon )}$. Thus, on an average, H_n(X) + ε bits suffice for encoding with probability greater than 1 − δ, where Template:Mvar and Template:Mvar can be made arbitrarily small, by making Template:Mvar larger.

See also

• Channel coding
• Error exponent
• Noisy-channel coding theorem