Namespaces
Variants
Actions

Optimal decoding

From Encyclopedia of Mathematics
Revision as of 16:58, 7 February 2011 by 127.0.0.1 (talk) (Importing text file)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

A decoding which maximizes the exactness of information reproduction (cf. Information, exactness of reproducibility of) for given sources of information, communication channels and coding methods. In case the exactness of information reproduction is characterized by the mean probability of erroneous decoding (cf. Erroneous decoding, probability of), optimal decoding minimizes this probability. For example, for a transmission of information represented by the numbers , the probabilities of appearance of which are , respectively, a discrete channel is used with a finite number of input and output signals and with transition function defined by the matrix

where , are the sets of values of the signals of the input and the output , respectively, while the coding is defined by the function for which , , where , , is a code, i.e. a choice of possible input values. Then an optimal decoding is defined by a function such that for any , where satisfies the inequality

for all . In particular, if all information has equal probability, i.e. , then the described optimal decoding is also a decoding by the method of "maximum likelihood" (which is generally not optimal): The output signal has to be decoded in the information for which

References

[1] R. Gallagher, "Information theory and reliable communication" , Wiley (1968)
[2] J.M. Wozencraft, I.M. Jacobs, "Principles of communication engineering" , Wiley (1965)


Comments

Cf. also Coding and decoding; Information theory.

How to Cite This Entry:
Optimal decoding. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Optimal_decoding&oldid=12294
This article was adapted from an original article by R.L. DobrushinV.V. Prelov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article