A general algorithm for distributing information in a graph
S.M. Aji, Robert J. McEliece · 2002
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.