Improvements of Speed and Performance of Data Compression Based on Dictionary and Context Similarity (1997)
| Citations: | 4 - 1 self |
BibTeX
@TECHREPORT{Sadakane97improvementsof,
author = {Kunihiko Sadakane},
title = {Improvements of Speed and Performance of Data Compression Based on Dictionary and Context Similarity},
institution = {},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Many data compression schemes are developed nowadays and they are selected according to requirements, such as fast encoding, fast decoding, good compression performance, small amount of required memory, etc. Data compression schemes can be divided into two schemes: dictionary method and statistical method. The former encodes strings to be compressed to indices into a dictionary. Since it runs quickly with small memory, it is widely used in compress or gzip command in unix. The latter encodes characters one by one according to the probability of occurrence of characters. As the speed and memory of CPU increase, the statistical method becomes available and the compression performance is improved. Recently, block sorting compression and a compression based on context similarity was developed and the relationship among these two methods and the previous methods was studied. In this thesis, improvements of speed and performance of data compression based on dictionary and context similarity ...
