Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information(Source Coding/Imge Processing)(<Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2003-10-01
著者
-
Uyematsu Tomohiko
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
KUZUOKA Shigeaki
Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
Kuzuoka S
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Kuzuoka Shigeaki
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
関連論文
- Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
- Conditional Lempel-Ziv Complexity and Its Application to Source Coding Theorem with Side Information(Source Coding/Imge Processing)(Information Theory and Its Applications)
- Universal Lossy Coding for Individual Sequences Based on Complexity Functions(Information Theory)
- Relationship among Complexities of Individual Sequences over Countable Alphabet(Information Theory)
- Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet
- Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices
- Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
- A New Unified Method for Fixed-Length Source Coding Problems of General Sources
- Fixed-Slope Universal Lossy Coding for Nonstationary Sources
- Applicability of the Sample Path Method of Ergodic Processes to Individual Sequences
- An algorithm for random number generation by using arithmetic of limited precision : Part II
- A General Formula of the Capacity Region for Multiple-Access Channels with Deterministic Feedback
- A Universal Affine Code for Symmetric Channels
- Parametric Forms of the Achievable Rate Region for Source Coding with a Helper