International audienceIn the context of Distributed Source Coding, we propose a low complexity algorithm for the estimation of the cross-over probability p of the Binary Symmetric Channel (BSC) modeling the correlation between two binary sources. The coding is done with linear block codes. We propose a novel method to estimate p prior to decoding and show that it is the Maximum Likelihood estimator of p with respect to the syndromes of the correlated sources. The method can be utilized for the parameter estimation for channel coding of binary sources over the BSC

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.

No abstract