𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Data Compression for PC Software Distribution

✍ Scribed by TONG LAI YU

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
885 KB
Volume
26
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents the design and implementation of a data compression scheme that can be used for PC software distribution. The method utilizes a lazy parsing strategy and a large slidingwindow to obtain good compression ratio. A large window is used to read in characters from a file and a suffix tree is constructed to search for the longest matching substring. Lazy parsing is used to improve the compression performance moderately. Modified unary codes and Huffman codes are used to encode the displacements, copy-lengths and copied symbols. Although the encoder is complex, the expansion phase of such a coder is simple and works very fast; experimental results confirm this fact. Such a compression scheme is most appropriate to he used for PC software distribution.

πŸ“œ SIMILAR VOLUMES

Software Data Prefetching for Software P
Software Data Prefetching for Software Pipelined Loops
✍ JesΓΊs SΓ‘nchez; Antonio GonzΓ‘lez πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 436 KB

This paper focuses on the interaction between software prefetching (both binding and nonbinding prefetch) and software pipelining for statically scheduled machines. First, it is shown that evaluating software pipelined schedules without considering memory effects can be rather inaccurate due to stal

Software for material safety data sheets
Software for material safety data sheets
✍ Kumar, Ashok ;D'Souza, F. ;Vashisth, S. πŸ“‚ Article πŸ“… 1996 πŸ› American Institute of Chemical Engineers 🌐 English βš– 492 KB
Greedy Algorithms for On-Line Data Compr
Greedy Algorithms for On-Line Data Compression
✍ JΓ³zsef BΓ©kΓ©si; GΓ‘bor Galambos; Ulrich Pferschy; Gerhard J Woeginger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 191 KB

We consider on-line text-compression problems where compression is done by Ε½ . substituting substrings according to some fixed static dictionary code book . Due to the long running time of optimal algorithms, several heuristics have been introduced in the literature. In this paper, we continue the i