Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices
スポンサーリンク
概要
- 論文の詳細を見る
Low-density parity-check (LDPC) codes become very popular in channel coding, since they can achieve the performance close to maximum-likelihood (ML) decoding with linear complexity of the block length. Recently, Muramatsu et al. proposed a code using LDPC matrices for Slepian-Wolf source coding, and showed that their code can achieve any point in the achievable rate region of Slepian-Wolf source coding. However, since they employed ML decoding, their decoder needs to know the probability distribution of the source. Hence, it is an open problem whether there exists a universal code using LDPC matrices, where universal code means that the error probability of the code vanishes as the block length tends to infinity for all sources whose achievable rate region contains the rate pair of encoders. In this paper, we show the existence of a universal Slepian-Wolf source code using LDPC matrices for stationary memoryless sources.
- （社）電子情報通信学会の論文
- 2010-11-01
著者
-
Uyematsu Tomohiko
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
MATSUMOTO Ryutaroh
Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
MATSUTA Tetsunao
Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
Matsumoto Ryutaroh
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
Dept. Of Comm. And Integrated Systems Tokyo Institute Of Technology
-
Matsuta Tetsunao
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Matsuta Tetsunao
Dept. Of Communications And Integrated Systems Tokyo Inst. Of Technol.
関連論文
- 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)
- Construction of wiretap codes from ordinary channel codes (情報処理)
- Construction of wiretap codes from ordinary channel codes (情報セキュリティ)
- Construction of wiretap codes from ordinary channel codes (ワイドバンドシステム)
- 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
- Parametric Forms of the Achievable Rate Region for Source Coding with a Helper