On a Problem of Separate Coding of Two Dependent Sources

The random-coding procedure is employed to solve the Slepian–Wolf problem of compression of information produced by two dependent sources. An upper bound for the error probability is determined and a general formula for an arbitrary finite number of sources is given.