Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.11 pp.1878-1888
- Publication Date
- 2010/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.1878
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Source Coding
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tetsunao MATSUTA, Tomohiko UYEMATSU, Ryutaroh MATSUMOTO, "Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 1878-1888, November 2010, doi: 10.1587/transfun.E93.A.1878.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1878/_p
Copy
@ARTICLE{e93-a_11_1878,
author={Tetsunao MATSUTA, Tomohiko UYEMATSU, Ryutaroh MATSUMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices},
year={2010},
volume={E93-A},
number={11},
pages={1878-1888},
abstract={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.},
keywords={},
doi={10.1587/transfun.E93.A.1878},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Universal Slepian-Wolf Source Codes Using Low-Density Parity-Check Matrices
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1878
EP - 1888
AU - Tetsunao MATSUTA
AU - Tomohiko UYEMATSU
AU - Ryutaroh MATSUMOTO
PY - 2010
DO - 10.1587/transfun.E93.A.1878
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2010
AB - 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.
ER -
English
