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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2003 IEEE International Symposium on Information Theory S. 142
Hauptverfasser: Uyematsu, T., Kuzuoka, S.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 2003
Schlagworte:
Entropy
Information theory
Probability distribution
Random number generation
Random variables
Source coding
Testing
ISBN:9780780377288, 0780377281
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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