## Encyclopedia > Entropy coding

Article Content

# Entropy encoding

Redirected from Entropy coding

An entropy encoding is a coding scheme that assigns codes to symbols so as to match code lengths with the probabilities of the symbols. Typically, entropy encoders are used to compress data by replacing symbols represented by equal-length codes with symbols represented by codes proportional to the negative logarithm of the probability. Therefore, the most common symbols use the shortest codes.

According to Shannon's theorem, the optimal code length for a symbol is -logbP, where b is the number of symbols used to make output codes and P is the probability of the input symbol.

Two of the most common entropy encoding techniques are Huffman coding and arithmetic encoding. If the approximate entropy characteristics of a data stream are known in advance (especially for signal compression), a simpler static code such as Unary coding, Elias Gamma coding, Fibonacci coding, Golomb coding, or Rice coding may be useful.

An earlier version of the above article was posted on PlanetMath (http://planetmath.org/encyclopedia/EntropyEncoding). This article is open content.

See also: entropy, Universal code[?]

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia
 Search over one million articles, find something about almost anything!

Featured Article
 Digital Rights Management ... non-US). Most would include in all computer systems obligatory mechanisms controlling use in ways deemed by copyright holders to be unacceptable. See Professor Edward ...

This page was created in 114.5 ms