Redundancy (information theory)

In describing the redundancy of raw data, the rate of a source of information is the average entropy per symbol. For memoryless sources, this is merely the entropy of each symbol, while, in the most general case of a stochastic process, it is

${\displaystyle r=\lim _{n\to \infty }{\frac {1}{n}}H(M_{1},M_{2},\dots M_{n}),}$ 

in the limit, as n goes to infinity, of the joint entropy of the first n symbols divided by n. It is common in information theory to speak of the "rate" or "entropy" of a language. This is appropriate, for example, when the source of information is English prose. The rate of a memoryless source is simply ${\displaystyle H(M)}$ , since by definition there is no interdependence of the successive messages of a memoryless source.^{[citation needed]}

The absolute rate of a language or source is simply

${\displaystyle R=\log |\mathbb {M} |,\,}$ 

the logarithm of the cardinality of the message space, or alphabet. (This formula is sometimes called the Hartley function.) This is the maximum possible rate of information that can be transmitted with that alphabet. (The logarithm should be taken to a base appropriate for the unit of measurement in use.) The absolute rate is equal to the actual rate if the source is memoryless and has a uniform distribution.

The absolute redundancy can then be defined as

${\displaystyle D=R-r,\,}$ 

the difference between the absolute rate and the rate.

The quantity ${\displaystyle {\frac {D}{R}}}$  is called the relative redundancy and gives the maximum possible data compression ratio, when expressed as the percentage by which a file size can be decreased. (When expressed as a ratio of original file size to compressed file size, the quantity ${\displaystyle R:r}$  gives the maximum compression ratio that can be achieved.) Complementary to the concept of relative redundancy is efficiency, defined as ${\displaystyle {\frac {r}{R}},}$  so that ${\displaystyle {\frac {r}{R}}+{\frac {D}{R}}=1}$ . A memoryless source with a uniform distribution has zero redundancy (and thus 100% efficiency), and cannot be compressed.

A measure of redundancy between two variables is the mutual information or a normalized variant. A measure of redundancy among many variables is given by the total correlation.

Redundancy of compressed data refers to the difference between the expected compressed data length of ${\displaystyle n}$  messages ${\displaystyle L(M^{n})\,\!}$  (or expected data rate ${\displaystyle L(M^{n})/n\,\!}$ ) and the entropy ${\displaystyle nr\,\!}$  (or entropy rate ${\displaystyle r\,\!}$ ). (Here we assume the data is ergodic and stationary, e.g., a memoryless source.) Although the rate difference ${\displaystyle L(M^{n})/n-r\,\!}$  can be arbitrarily small as ${\displaystyle n\,\!}$  increased, the actual difference ${\displaystyle L(M^{n})-nr\,\!}$ , cannot, although it can be theoretically upper-bounded by 1 in the case of finite-entropy memoryless sources.

Redundancy in an information-theoretic contexts can also refer to the information that is redundant between two mutual informations. For example, given three variables ${\displaystyle X_{1}}$ , ${\displaystyle X_{2}}$ , and ${\displaystyle Y}$ , it is known that the joint mutual information can be less than the sum of the marginal mutual informations: ${\displaystyle I(X_{1},X_{2};Y)<I(X_{1};Y)+I(X_{2};Y)}$ . In this case, at least some of the information about ${\displaystyle Y}$  disclosed by ${\displaystyle X_{1}}$  or ${\displaystyle X_{2}}$  is the same. This formulation of redundancy is complementary to the notion of synergy, which occurs when the joint mutual information is greater than the sum of the marginals, indicating the presence of information that is only disclosed by the joint state and not any simpler collection of sources.^[3][4]

The above pairwise redundancy measure can be generalized to a set of n variables.

${\displaystyle Redundancy=I(X_{1},X_{2},...,X_{n};Y)-\left(I(X_{1};Y)+I(X_{2};Y)+...I(X_{n};Y)\right)}$ . ^[5] As the pair-wise measure above, if this value is negative, one says the set of variables is redundant.

• Minimum redundancy coding
  • Huffman encoding
• Data compression
• Hartley function
• Negentropy
• Source coding theorem
• Overcompleteness

• Reza, Fazlollah M. (1994) [1961]. An Introduction to Information Theory. New York: Dover [McGraw-Hill]. ISBN 0-486-68210-2.
• Schneier, Bruce (1996). Applied Cryptography: Protocols, Algorithms, and Source Code in C. New York: John Wiley & Sons, Inc. ISBN 0-471-12845-7.
• Auffarth, B; Lopez-Sanchez, M.; Cerquides, J. (2010). "Comparison of Redundancy and Relevance Measures for Feature Selection in Tissue Classification of CT images". Advances in Data Mining. Applications and Theoretical Aspects. Springer. pp. 248–262. CiteSeerX 10.1.1.170.1528.