Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2615-2617
- Publication Date
- 2003/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Source Coding/Image Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tomohiko UYEMATSU, Shigeaki KUZUOKA, "Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 10, pp. 2615-2617, October 2003, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2615/_p
Copy
@ARTICLE{e86-a_10_2615,
author={Tomohiko UYEMATSU, Shigeaki KUZUOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information},
year={2003},
volume={E86-A},
number={10},
pages={2615-2617},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2615
EP - 2617
AU - Tomohiko UYEMATSU
AU - Shigeaki KUZUOKA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2003
AB - 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.
ER -
English
