Text Compression Using Prediction.
Jukka Teuhola, Timo Raita:
Text Compression Using Prediction.
SIGIR 1986: 97-102@inproceedings{DBLP:conf/sigir/TeuholaR86,
author = {Jukka Teuhola and
Timo Raita},
title = {Text Compression Using Prediction},
booktitle = {SIGIR'86, Proceedings of the 9th Annual International ACM SIGIR
Conference on Research and Development in Information Retrieval,
Pisa, Italy, September 8-10, 1986},
publisher = {ACM},
year = {1986},
pages = {97-102},
ee = {db/conf/sigir/TeuholaR86.html},
crossref = {DBLP:conf/sigir/86},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Abstract
In the compression of the text files, the dependencies between the successive characters should be
exploited to as great an extent as possible. There are two obvious possibilities: either to detect and
encode often occurring character strings, or to encode successors of character blocks. This paper
presents two methods based on the latter approach. In the first method we encode only the most
probable successors of blocks, whereas in the second we encode them all, using the knowledge of
their distribution. The second method uses recursion to store effectively the dependencies between
the characters and this results in good compression gains in practical cases.
Copyright © 1986 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
CDROM Version: Load the CDROM "Volume 2 Issue 3, SIGIR, DASFAA'97, OODBS'86" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
Printed Edition
SIGIR'86, Proceedings of the 9th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Pisa, Italy, September 8-10, 1986.
ACM 1986
Contents 
Citation Page
Copyright © Mon Nov 2 21:09:47 2009
by Michael Ley (ley@uni-trier.de)
