Slepian-Wolf type problems on the erasure channel

Suppose that we have two users each of which has a k-dimensional vector over a field FQ. Their goal is to communicate their vectors to a common receiver. At the time of reception, the receiver is given side information consisting of some of the entries of the first vector, some entries of the second vector, and the knowledge that some other entries of the two vectors are equal. The task is to design encoders for the two users in such a way that the receiver is able to recover the two vectors when given the side information and some of the entries of the encoded vectors. We call this problem the simultaneous erasure Slepian-Wolf problem, and we provide an optimal solution to this problem using rank-metric codes, provided that the field size

[1]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[2]  Javier Garcia-Frías,et al.  Approaching the slepian-wolf boundary using practical channel codes , 2004, ISIT.

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

[4]  Dake He,et al.  Rateless Slepian-Wolf Coding Based on Rate Adaptive Low-Density-Parity-Check Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[5]  Kannan Ramchandran,et al.  Generalized coset codes for distributed binning , 2005, IEEE Transactions on Information Theory.

[6]  Amin Shokrollahi,et al.  Fountain Codes for the Slepian-Wolf Problem , 2006 .

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

[8]  Zixiang Xiong,et al.  On code design for the Slepian-Wolf problem and lossless multiterminal networks , 2006, IEEE Transactions on Information Theory.