Variable-Length Code
A Variable-Length Code is a coding system that maps source symbols to a variable number of bits.
- AKA: Variable Length Coding.
- Example(s):
- Counter-Example(s):
- See: Arithmetic Coding, Lossless Data Compression, Information Entropy, Lempel–Ziv.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/variable-length_code Retrieved:2015-2-17.
- In coding theory a variable-length code is a code which maps source symbols to a variable number of bits.
Variable-length codes can allow sources to be compressed and decompressed with zero error (lossless data compression) and still be read back symbol by symbol. With the right coding strategy an independent and identically-distributed source may be compressed almost arbitrarily close to its entropy. This is in contrast to fixed length coding methods, for which data compression is only possible for large blocks of data, and any compression beyond the logarithm of the total number of possibilities comes with a finite (though perhaps arbitrarily small) probability of failure.
Some examples of well-known variable-length coding strategies are Huffman coding, Lempel–Ziv coding and arithmetic coding.
- In coding theory a variable-length code is a code which maps source symbols to a variable number of bits.