Comparison between universal data-compression algorithms applied to Markov sources

A comparison between universal data compression algorithms applied to binary Markov sources is presented. Four algorithms are considered (1) The Ziv-Lempel (Z-L) algorithm proposed in 1978. (2) A state conditioned version of the Z-L algorithm. (3) Rissanen's algorithm (1986). (4) A sequential a...

Full description

Bibliographic Details

Published in:	IEEE Seventeenth Conference of Electrical and Electronics Engineers in Israel, 1991 pp. 111 - 114
Main Authors:	Amir, I., Plotnik, E., Weinberger, M.J., Tal, N.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 1991
Subjects:	Algorithm design and analysis Analytical models Arithmetic Data compression Decoding Entropy Probability
ISBN:	9780879426781, 0879426780
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!