On the performance of linear Slepian-Wolf codes for correlated stationary memoryless sources

We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields. By using this tool, we analyze the performance of SW codes based on LDPC codes and random permutations, and show that under some conditions, all but a diminishingly small proportion of LDPC encoders and permutations are good enough for the design of practical SW systems when the coding length is very large.

[1]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[2]  Jun Muramatsu,et al.  Low-density parity-check matrices for coding of correlated sources , 2003, IEEE Transactions on Information Theory.

[3]  Zixiang Xiong,et al.  Design of Slepian-Wolf codes by channel code partitioning , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[4]  Imre Csiszár.  Linear codes for sources and source networks: Error exponents, universal coding , 1982, IEEE Trans. Inf. Theory.

[5]  Te Sun Han,et al.  Universal coding for the Slepian-Wolf data compression system and the strong converse theorem , 1994, IEEE Trans. Inf. Theory.

[6]  F. Kanaya,et al.  Coding Theorems on Correlated General Sources , 1995 .

[7]  Kannan Ramchandran,et al.  Distributed code constructions for the entire Slepian-Wolf rate region for arbitrarily correlated sources , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[8]  Tomohiko Uyematsu,et al.  Universal Coding for Correlated Sources with Memory , 2001 .

[9]  Robert G. Gallager,et al.  A simple derivation of the coding theorem and some applications , 1965, IEEE Trans. Inf. Theory.

[10]  Imre Csiszár,et al.  Towards a general theory of source networks , 1980, IEEE Trans. Inf. Theory.

[11]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[12]  Meir Feder,et al.  Random coding techniques for nonrandom codes , 1999, IEEE Trans. Inf. Theory.

[13]  David Burshtein,et al.  Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes , 2000, IEEE Trans. Inf. Theory.

[14]  Thomas M. Cover,et al.  A Proof of the Data Compression Theorem of Slepian and Wolf for Ergodic Sources , 1971 .

[15]  Rick S. Blum,et al.  Slepian-Wolf coding for nonuniform sources using turbo codes , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[16]  K. Ramchandran,et al.  Distributed source coding using syndromes (DISCUS): design and construction , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[17]  Tomohiko Uyematsu.  An algebraic construction of codes for Slepian-Wolf source networks , 2001, IEEE Trans. Inf. Theory.

[18]  Muriel Médard,et al.  On some new approaches to practical Slepian-Wolf compression inspired by channel coding , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[19]  David Burshtein,et al.  On the application of LDPC codes to arbitrary discrete-memoryless channels , 2003, IEEE Transactions on Information Theory.