## Data Compression (1987)

Venue: | ACM Computing Surveys |

Citations: | 85 - 3 self |

### BibTeX

@ARTICLE{Lelewer87datacompression,

author = {Debra A. Lelewer and Daniel S. Hirschberg},

title = {Data Compression},

journal = {ACM Computing Surveys},

year = {1987},

volume = {19},

pages = {261--296}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper surveys a variety of data compression methods spanning almost forty years of research, from the work of Shannon, Fano and Huffman in the late 40's 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. INTRODUCTION Data compression is often referred to as coding, where coding is a very general term encompassing any special representation of data which satisfies a given need. Information theory is defined to be the study of eff...