In general terms, entropy is a measure of ``disorder'' and can be seen as depending directly on probability:
, where k and k0 are constants and P is the probability of a state.
Entropy is also a concept used in information theory; if N states are possible, each characterized by a probability pi, with
, then
is the entropy, the lowest bound on the number of bits needed to describe all parts of the system; it corresponds to the information content of the system (see [Jain89]).
This is used in data compression: entropy encoding makes use of the non-uniform occurrence of bit patterns in some quantized scheme.
An efficient entropy encoding technique is Huffman coding.