Rate-adaptive codes for the entire Slepian-Wolf region and arbitrarily correlated sources

In this paper, we focus on the design of distributed source codes that can achieve any point in the Slepian-Wolf (SW) region and at the same time adapt to any correlation between the sources. A practical solution based on punctured accumulated LDPC codes extended to the non asymmetric case is described. The approach allows flexible rate allocation to the two sources with a gap of 0.0677 bits with respect to the minimum achievable rate.