Entropy Coding - Wikipedia
Entropy Coding - Wikipedia
Entropy coding
In information theory an entropy coding (or 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. [1] 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 of
occurrence of that codeword. Therefore, the most common symbols use the shortest codes.[2]
According to Shannon's source coding 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 coding techniques are Huffman coding and arithmetic coding.[3]
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.
Contents
Entropy as a measure of similarity
See also
References
External links
See also
Arithmetic coding
https://en.wikipedia.org/wiki/Entropy_coding 1/2
9/24/21, 4:18 PM Entropy coding - Wikipedia
References
1. "Education - Entropy Encoding" (http://www.pcs-ip.eu/index.php/main/edu/8). www.pcs-ip.eu.
Retrieved 2020-10-13.
2. "What is Entropy Coding | IGI Global" (https://www.igi-global.com/dictionary/entropy-coding/1004
0). www.igi-global.com. Retrieved 2020-10-13.
3. 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 (https://doi.org/10.1109%2Fjrproc.1952.273898).
ISSN 0096-8390 (https://www.worldcat.org/issn/0096-8390).
External links
Information Theory, Inference, and Learning Algorithms (http://www.inference.phy.cam.ac.uk/mack
ay/itila/book.html), by David MacKay (2003), gives an introduction to Shannon theory and data
compression, including the Huffman coding and arithmetic coding.
Source Coding (http://iphome.hhi.de/wiegand/assets/pdfs/VBpart1.pdf), by T. Wiegand and H.
Schwarz (2011).
https://en.wikipedia.org/wiki/Entropy_coding 2/2