A New Unified Method for Fixed-Length Source Coding Problems of General Sources
スポンサーリンク
概要
- 論文の詳細を見る
This paper establishes a new unified method for fixed-length source coding problems of general sources. Specifically, we introduce an alternative definition of the smooth Rényi entropy of order zero, and show a unified approach to present the fixed-length coding rate in terms of this information quantity. Our definition of the smooth Rényi entropy has a clear operational meaning, and hence is easy to calculate for finite block lengths. Further, we represent various ε-source coding rate and the strong converse property for general sources in terms of the smooth Rényi entropy, and compare them with the results obtained by Han and Renner et al.
- （社）電子情報通信学会の論文
- 2010-11-01
著者
-
Uyematsu Tomohiko
Dept. Of Communications 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