Data Compression

Abstract

Abstract Lossless compression systems and lossy compression systems are the two types of data compression systems. In a lossless compression system, a lossless code is designed to encode/decode source data in order to provide the user with perfect reconstruction of the data. An efficient lossless code is one for which the compression rate in code bits per data sample is minimized or nearly minimized. The four most commonly used classes of potentially efficient lossless codes are covered: Huffman codes, enumerative codes, arithmetic codes, and Lempel‐Ziv codes. In a lossy compression system, a lossy code is designed to encode/decode source data in order to provide the user with a reconstruction of the data that is perceptually equivalent to the original data. An efficient lossy code is one which provides an attractive tradeoff between the compression rate and the distortion between the reconstructed data and the original data. The four most commonly used classes of potentially efficient lossy codes are covered: scalar quantizer based codes, vector quantizer based codes, trellis based codes, and transform codes.

Cite this paper

@misc{kieffer2003data,
  title = {{Data Compression}},
  author = {Kieffer, John C.},
  year = {2003},
  doi = {10.1002/0471219282.eot308}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers