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 maximum-likelihood (ML) decoding with linear complexity of the block length. Muramatsu et al. proposed a code using LDPC matrices for Slepian-Wolf source coding. However, since they employed ML decoding, their code is not universal, that is their decoder needs to know the probability distribution of the source. On the other hand, if there exists a universal code using LDPC matrices, we can arbitrary decrease the error probability for all sources whose achievable rate region contains the rate pair of encoders even if the probability distribution of sources is unknown. To this end, we show the existence of a universal Slepian-Wolf source code using LDPC matrices in the case where the source is stationary memoryless.