# Entropy encoding

This article includes a list of references, related reading or external links, but its sources remain unclear because it lacks inline citations. (December 2013) (Learn how and when to remove this template message) |

In information theory an ** entropy encoding** is a lossless data compression scheme that is independent of the specific characteristics of the medium.

One of the main types of entropy coding creates and assigns a unique prefix-free code to each unique symbol that occurs in the input; these entropy encoders then compress data by replacing each fixed-length input symbol with the corresponding variable-length prefix-free output codeword. The length of each codeword is approximately proportional to the negative logarithm of the probability. Therefore, the most common symbols use the shortest codes.

According to Shannon's source coding theorem, the optimal code length for a symbol is −log* _{b}P*, 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 coding.^{[1]}
If the approximate entropy characteristics of a data stream are known in advance (especially for signal compression), a simpler static code may be useful;
these static codes include universal codes (such as Elias gamma coding or Fibonacci coding) and Golomb codes (such as unary coding or Rice coding).

Since 2014, data compressors have started using the Asymmetric Numeral Systems family of entropy coding techniques, which allows combination of the compression ratio of arithmetic coding with a processing cost similar to Huffman coding.

## Entropy as a measure of similarity[edit]

Besides using entropy encoding as a way to compress digital data, an entropy encoder can also be used to measure the amount of similarity between streams of data and already existing classes of data; this is done by generating an entropy coder/compressor for each class of data; unknown data is then classified by feeding the uncompressed data to each compressor and seeing which compressor yields the highest compression. The coder with the best compression is probably the coder trained on the data that was most similar to the unknown data.

## See also[edit]

## References[edit]

**^**Huffman, David (1952). "A Method for the Construction of Minimum-Redundancy Codes".*Proceedings of the IRE*. Institute of Electrical and Electronics Engineers (IEEE).**40**(9): 1098–1101. doi:10.1109/jrproc.1952.273898. ISSN 0096-8390.

## External links[edit]

*Information Theory, Inference, and Learning Algorithms*, by David MacKay (2003), gives an introduction to Shannon theory and data compression, including the Huffman coding and arithmetic coding.*Source Coding,*by T. Wiegand and H. Schwarz (2011).