Rateless Slepian-Wolf Codes

The design and optimization of rateless codes for Slepian-Wolf encoding are considered. Rateless codes are pro- posed to address two shortcomings of currently available Slepian- Wolf schemes: their fragility to changing source statistics, and their inability to guarantee successful decoding for practical block length. We propose a novel type of optimized rateless code, called a Matrioshka code, to deal with the particular conditions of Slepian-Wolf encoding.

[1]  Andrew W. Eckford,et al.  Density evolution for the simultaneous decoding of LDPC-based slepian-wolf source codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[2]  Masoud Ardakani,et al.  A more accurate one-dimensional analysis and design of irregular LDPC codes , 2004, IEEE Transactions on Communications.

[3]  S. Brink.  Convergence of iterative decoding , 1999 .

[4]  Wei Zhong,et al.  LDPC codes for compression of multi-terminal sources with hidden Markov correlation , 2003, IEEE Communications Letters.

[5]  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.

[6]  Yongyi Mao,et al.  Rateless coding over fading channels , 2006, IEEE Communications Letters.

[7]  Shlomo Shamai,et al.  Universal variable-length data compression of binary sources using fountain codes , 2004, Information Theory Workshop.

[8]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[10]  Omid Etesami,et al.  Raptor codes on symmetric channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[11]  Stark C. Draper.  Universal Incremental Slepian-Wolf Coding , 2004 .

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

[13]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[14]  Jonathan S. Yedidia,et al.  Rateless codes on noisy channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..