Conditional Lempel-Ziv complexity and its application to source coding theorem with side information

This paper proposes the conditional LZ complexity and analyzes its property. Especially, we show an inequality corresponding to Ziv's inequality concerning a distinct parsing of a pair of sequences. Further, as a byproduct of the result, we show a simple proof of the asymptotical optimality of...

Full description

Saved in:
Bibliographic Details
Published in:2003 IEEE International Symposium on Information Theory p. 142
Main Authors: Uyematsu, T., Kuzuoka, S.
Format: Conference Proceeding
Language:English
Published: IEEE 2003
Subjects:
Entropy
Information theory
Probability distribution
Random number generation
Random variables
Source coding
Testing
ISBN:9780780377288, 0780377281
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper proposes the conditional LZ complexity and analyzes its property. Especially, we show an inequality corresponding to Ziv's inequality concerning a distinct parsing of a pair of sequences. Further, as a byproduct of the result, we show a simple proof of the asymptotical optimality of Ziv's universal source coding algorithm with side information.
ISBN:9780780377288
0780377281
DOI:10.1109/ISIT.2003.1228156