Thumbnail
Access Restriction
Subscribed

Author Rubin, Frank
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Data file compaction ♦ Text compression ♦ Huffman codes ♦ N-gram encoding ♦ Comparison of algorithms
Abstract A system for the compression of data files, viewed as strings of characters, is presented. The method is general, and applies equally well to English, to PL/I, or to digital data. The system consists of an encoder, an analysis program, and a decoder. Two algorithms for encoding a string differ slightly from earlier proposals. The analysis program attempts to find an optimal set of codes for representing substrings of the file. Four new algorithms for this operation are described and compared. Various parameters in the algorithms are optimized to obtain a high degree of compression for sample texts.
Description Affiliation: IBM, Poughkeepsie, NY (Rubin, Frank)
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 19
Issue Number 11
Page Count 7
Starting Page 617
Ending Page 623


Open content in new tab

   Open content in new tab
Source: ACM Digital Library