  Distributed arithmetic coding (DAC) has been shown to be effective for
Slepian-Wolf coding, especially for short data blocks. In this letter, we
propose to use the DAC to compress momery-correlated sources. More
specifically, the correlation between sources is modeled as a hidden Markov
process. Experimental results show that the performance is close to the
theoretical Slepian-Wolf limit.
