Data compression
-
- Debra A. Lelewer
- Univ. of California, Irvine
-
- Daniel S. Hirschberg
- Univ. of California, Irvine
Description
<jats:p>This paper surveys a variety of data compression methods spanning almost 40 years of research, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique developed in 1986. The aim of data compression is to reduce redundancy in stored or communicated data, thus increasing effective data density. Data compression has important application in the areas of file storage and distributed systems. Concepts from information theory as they relate to the goals and evaluation of data compression methods are discussed briefly. A framework for evaluation and comparison of methods is constructed and applied to the algorithms presented. Comparisons of both theoretical and empirical natures are reported, and possibilities for future research are suggested.</jats:p>
Journal
-
- ACM Computing Surveys
-
ACM Computing Surveys 19 (3), 261-296, 1987-09
Association for Computing Machinery (ACM)
- Tweet
Details 詳細情報について
-
- CRID
- 1363388844579534464
-
- NII Article ID
- 80003852496
-
- ISSN
- 15577341
- 03600300
-
- Data Source
-
- Crossref
- CiNii Articles