Universal Lossy Coding for Individual Sequences Based on Complexity Functions(Information Theory)
スポンサーリンク
概要
- 論文の詳細を見る
This paper investigates the fixed-rate and fixed-distortion lossy coding problems of individual sequences subject to the subadditive distortion measure. The fixed-rate and fixed-distortion universal lossy coding schemes based on the complexity of the sequence are proposed. The obtained coding theorems reveal that the optimal distortion (resp. rate) attainable by the fixed-rate (resp. fixed-distortion) lossy coding is equal to the optimal average distortion (resp. rate) with respect to the overlapping empirical distribution of the given sequence. Some connections with the lossy coding problem of ergodic sources are also investigated.
- 社団法人電子情報通信学会の論文
- 2007-02-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 Shigeaki
Wakayama Univ. Wakayama‐shi Jpn
-
Kuzuoka Shigeaki
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
-
UYEMATSU Tomohiko
Dept. of Communications 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)
- Universal Coding for Correlated Sources with Complementary Delivery(Information Theory and Its Applications)
- Universal source coding for complementary delivery
- 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
- A-6-9 On the Suboptimality of Linear Lossy Codes
- A-6-5 A Lower Bound on the Codeword Length of Grammar Based Codes
- 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