Redundancy of MPM data compression system
暂无分享，去创建一个
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).
[1] Marcelo J. Weinberger,et al. Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm , 1992, IEEE Trans. Inf. Theory.
[2] John C. Kieffer,et al. Design of context-free grammars for lossless data compression , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).