Entropy coding: Difference between revisions

Content deleted Content added
updated internal links
Deleted range coding from the list of most common techniques (it's the same as arithmetic coding).
Line 3:
According to [[Claude Shannon|Shannon's]] [[source coding theorem]], the optimal code length for a symbol is &minus;log''<sub>b</sub>P'', where ''b'' is the number of symbols used to make output codes and ''P'' is the probability of the input symbol.
 
ThreeTwo of the most common entropy encoding techniques are [[Huffman coding]], [[range encoding]], and [[arithmetic coding]].
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.