The Slepian-Wolf coding problem for two sources is considered. It is known that vertices of the Slepian-Wolf region can be achieved with a complexity which is significantly lower than that of a general point and do not require that encoders are synchronized. It is shown that by splitting a source into two virtual sources one can reduce the problem of coding an arbitrary point to that of coding a vertex of a three-dimensional Slepian Wolf region. This approach generalizes to arbitrary number of sources.
No takes yet. Share an insight, caveat, or question.
Rimoldi et al. (2002) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: