Information AboutEntropy Coding |
| CATEGORIES ABOUT ENTROPY ENCODING | |
| lossless compression algorithms | |
| entropy and information | |
|
According to Shannon's Source Coding Theorem , the optimal code length for a symbol is −log''bP'', where ''b'' is the number of symbols used to make output codes and ''P'' is the probability of the input symbol. Three 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. SEE ALSO EXTERNAL LINKS
''An earlier (open content) version of the above article was posted on PlanetMath .'' |
|
|