Parametric Forms of the Achievable Rate Region for Source Coding with a Helper
スポンサーリンク
概要
- 論文の詳細を見る
Source coding with a helper is one of the most fundamental fixed-length source coding problem for correlated sources. For this source coding, Wyner and Ahlswede-Körner showed the achievable rate region which is the set of rate pairs of encoders such that the probability of error can be made arbitrarily small for sufficiently large block length. However, their expression of the achievable rate region consists of the sum of indefinitely many sets. Thus, their expression is not useful for computing the achievable rate region. This paper deals with correlated sources whose conditional distribution is related by a binary-input output-symmetric channel, and gives a parametric form of the achievable rate region in order to compute the region easily.
- The Institute of Electronics, Information and Communication Engineersの論文
著者
-
Uyematsu Tomohiko
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
-
Matsuta Tetsunao
Dept. Of Communications And Integrated Systems Tokyo Inst. Of Technol.
-
UYEMATSU Tomohiko
Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
Matsumoto Ryutaroh
Dept. of Communications and Computer Engineering, Tokyo Institute of Technology
-
MATSUTA Tetsunao
Dept. of Communications and Computer Engineering, 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
- Secure multiplex coding with a common message (ワイドバンドシステム・情報通信基礎サブソサイエティ合同研究会)
- 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
- Secure multiplex coding with a common message (情報理論・情報通信基礎サブソサイエティ合同研究会)
- Secure multiplex coding with a common message (情報セキュリティ・情報通信基礎サブソサイエティ合同研究会)
- 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
- Gilbert-Varshamov-type bound for relative dimension length profile
- Parametric Forms of the Achievable Rate Region for Source Coding with a Helper