Lossless source coding for multiple access networks

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of jointly distributed information sequences {X_i}_i=1^∞ and {Y_i}_i=1^∞ is drawn i.i.d. according to joint probability mass function (p.m.f.) p(x,y); the encoder for each source operates without knowledge of the other source; the decoder receives the encoded bit streams of both sources. The rate region for MASCs with arbitrarily small but non-zero error probabilities was studied by Slepian and Wolf. In this paper, we consider the properties of optimal truly lossless MASCs and apply our findings to practical truly lossless and near lossless code design