On the performance of data compression algorithms based upon string matching

Lossless and lossy data compression algorithms based on string matching are considered. In the lossless case, a result of Wyner and Ziv (1989) is extended. In the lossy case, a data compression algorithm based on approximate string matching is analyzed in the following two frameworks: (1) the databa...

Full description

Bibliographic Details

Published in:	IEEE transactions on information theory Vol. 44; no. 1; pp. 47 - 65
Main Authors:	En-hui Yang, Kieffer, J.C.
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.01.1998 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms Communication system control Data compression Decoding Encoding Information processing Information theory Random variables Rate-distortion Terrorism
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!