Thumbnail
Access Restriction
Subscribed

Author Tarjan, Robert E. ♦ Wei, Victor K. ♦ Sleator, Daniel D. ♦ Bentley, Jon Louis
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described. The scheme is based on a simple heuristic for self-organizing sequential search and on variable-length encodings of integers. We prove that it never performs much worse than Huffman coding and can perform substantially better; experiments on real files show that its performance is usually quite close to that of Huffman coding. Our scheme has many implementation advantages: it is simple, allows fast encoding and decoding, and requires only one pass over the data to be compressed (static Huffman coding takes two passes).
Description Affiliation: Bell Communications Research, Murray Hill, NJ (Wei, Victor K.) || Princeton Univ., Princeton, NJ (Tarjan, Robert E.) || AT&T Bell Laboratories, Murray Hill, NJ (Bentley, Jon Louis; Sleator, Daniel D.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 29
Issue Number 4
Page Count 11
Starting Page 320
Ending Page 330


Open content in new tab

   Open content in new tab
Source: ACM Digital Library