Lossless Data Compression Task

Context:
- It can be solved by a Lossless Data Compression System (that implements a Lossless Data Compression algorithm).
- …
Counter-Example(s):
- Lossy Data Compression Task.
See: Huffman Coding, Text Compression, Gzip.

References

(Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/lossless_compression Retrieved:2015-2-17.
- Lossless data compression is a class of data compression algorithms that allows the original data to be perfectly reconstructed from the compressed data. By contrast, lossy data compression permits reconstruction only of an approximation of the original data, though this usually improves compression rates (and therefore reduces file sizes).
  Lossless data compression is used in many applications. For example, it is used in the ZIP file format and in the GNU tool gzip. It is also often used as a component within lossy data compression technologies (e.g. lossless mid/side joint stereo preprocessing by the LAME MP3 encoder and other lossy audio encoders).
  Lossless compression is used in cases where it is important that the original and the decompressed data be identical, or where deviations from the original data could be deleterious. Typical examples are executable programs, text documents, and source code. Some image file formats, like PNG or GIF, use only lossless compression, while others like TIFF and MNG may use either lossless or lossy methods. Lossless audio formats are most often used for archiving or production purposes, while smaller lossy audio files are typically used on portable players and in other cases where storage space is limited or exact replication of the audio is unnecessary.