Answers are grounded in this paper and cite their sources.
We present a general "message-passing" algorithm for distributing information in a graph. This algorithm may help us to understand the approximate correctness of both the Gallager-Tanner-Wiberg algorithm, and the turbo-decoding algorithm.
No takes yet. Share an insight, caveat, or question.
Aji et al. (2002) studied this question.