(Untitled) | (Untitled) | (Untitled) | (Untitled) | (Untitled) | Examples |

IEVref: | 171-07-18 | ID: | |

Language: | en | Status: Standard | |

Term: | redundancy, <in information theory> | ||

Synonym1: | |||

Synonym2: | |||

Synonym3: | |||

Symbol: | R
| ||

Definition: | amount by which the decision content H_{0} exceeds the entropy H
EXAMPLE Let $\left\{a,b,c\right\}$ be a set of three events and let $p(a)=\mathrm{0,5}$, $p(b)=\mathrm{0,25}$ and $p(c)=\mathrm{0,25}$ be the probabilities of their occurrences. The redundancy of this set is: $R=\mathrm{1,585}\text{Sh}-\mathrm{1,50}\text{Sh}=\mathrm{0,085}\text{Sh}$. Note 1 to entry: Usually, messages can be represented with fewer characters by using suitable codes; the redundancy can be considered as a measure of the decrease of the average length of the messages accomplished by appropriate coding. | ||

Publication date: | 2019-03-29 | ||

Source: | IEC 80000-13:2008, 13-28, modified – Addition of information useful for the context of the IEV, and adaptation to the IEV rules | ||

Replaces: | |||

Internal notes: | |||

CO remarks: | |||

TC/SC remarks: | |||

VT remarks: | |||

Domain1: | |||

Domain2: | |||

Domain3: | |||

Domain4: | |||

Domain5: |

*R* = *H*_{0} − *H*

EXAMPLE Let $\left\{a,b,c\right\}$ be a set of three events and let $p(a)=\mathrm{0,5}$, $p(b)=\mathrm{0,25}$ and $p(c)=\mathrm{0,25}$ be the probabilities of their occurrences. The redundancy of this set is: $R=\mathrm{1,585}\text{Sh}-\mathrm{1,50}\text{Sh}=\mathrm{0,085}\text{Sh}$.

Note 1 to entry: Usually, messages can be represented with fewer characters by using suitable codes; the redundancy can be considered as a measure of the decrease of the average length of the messages accomplished by appropriate coding.