Conference paper
A lower bound for variable rate slepian-wolf coding
Da-Ke He, Luis A. Lastras-Montano, et al.
ISIT 2006
We consider Slepian-Wolf code design based on lowdensity parity-check (LDPC) coset codes. The density evolution formula for Slepian-Wolf coding is derived. An intimate connection between Slepian-Wolf coding and channel coding is then established. Specifically we show that, under density evolution, each Slepian-Wolf coding problem is equivalent to a channel coding problem for a binary-input output-symmetric channel. © 2009 IEEE.
Da-Ke He, Luis A. Lastras-Montano, et al.
ISIT 2006
Limin Liu, Da-Ke He, et al.
ICIP 2008
Jun Chen, Da-Ke He, et al.
IEEE ICC 2008
Jun Chen, Da-Ke He, et al.
ITW 2007