Title :
Redundancy of MPM data compression system
Author :
Kieffer, John C. ; Yang, En-Hui
Author_Institution :
Minnesota Univ., Minneapolis, MN, USA
Abstract :
A finite-state information source is losslessly encoded via the multilevel pattern matching (MPM) data compression system. The main result gives a pointwise redundancy bound better than the bound established by Plotnik et al. (see IEEE Trans. Information Theory, vol.38, p.66-72, 1992) for the Lempel-Ziv algorithm (1978 version)
Keywords :
data compression; information theory; pattern matching; redundancy; source coding; Lempel-Ziv algorithm; MPM data compression system; finite-state information source; lossless data compression; lossless encoding; multilevel pattern matching; pointwise redundancy bound; Arithmetic; Binary sequences; Compressors; Data compression; Encoding; Pattern matching; Skeleton;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708727
