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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2003 IEEE International Symposium on Information Theory s. 142
Hlavní autori: Uyematsu, T., Kuzuoka, S.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2003
Predmet:
Entropy
Information theory
Probability distribution
Random number generation
Random variables
Source coding
Testing
ISBN:9780780377288, 0780377281
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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