|
|
|
entropy encoding
|
(Definition)
|
|
|
An entropy encoding is a coding scheme that involves assigning 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
where  is the number of symbols used to make output codes and  is the probability of the input symbol.
Two of the most common entropy encoding techniques are Huffman encoding and arithmetic encoding.
|
"entropy encoding" is owned by vampyr.
|
|
(view preamble)
See Also: Huffman coding
| Other names: |
entropy encoder, entropy coding |
Cross-references: arithmetic encoding, Huffman encoding, Shannon's theorem, logarithm, scheme
There are 2 references to this object.
This is version 1 of entropy encoding, born on 2002-03-08
Object id is 2782, canonical name is EntropyEncoding.
Accessed 895 times total.
Classification:
| AMS MSC: | 68P30 (Computer science :: Theory of data :: Coding and information theory) | | | 94A24 (Information and communication, circuits :: Communication, information :: Coding theorems) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
