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...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on information theory Ročník 44; číslo 1; s. 47 - 65
Hlavní autori:	En-hui Yang, Kieffer, J.C.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.01.1998 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!