Affiliation:
1. Univ. of California, Irvine
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference78 articles.
1. ABRAMSON N. 1963. in{ormation Theory and Coding. McGraw-Hill New York. ABRAMSON N. 1963. in{ormation Theory and Coding. McGraw-Hill New York.
2. ARC 1986. ARC File Archive Utility Version 5.1. System Enhancement Associates Wayne N.J. ARC 1986. ARC File Archive Utility Version 5.1. System Enhancement Associates Wayne N.J.
3. ASH R. B. 1965. Information Theory. Interscience New York. ASH R. B. 1965. Information Theory. Interscience New York.
4. A locally adaptive data compression scheme
5. Graph theoretic prefix codes and their synchronizing properties;BOBROW L. S.;Inf. Contr.,1969
Cited by
158 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献