Achieving the entire Slepian-Wolf rate region using a single code with hidden Markov correlation

We consider the problem of compression of two correlated binary sources having memory in correlation defined by a hidden Markov model. We propose a constructive, flexible scheme through the use of low density parity check codes which can achieve any point on the Slepian-Wolf rate region. Our approach do not require the parity check matrices to be redesigned for arbitrarily changing the rates among the encoders.