A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Divide and Concur and Difference-Map BP Decoders for LDPC Codes
2011
IEEE Transactions on Information Theory
The "Divide and Concur" (DC) algorithm, recently introduced by Gravel and Elser, can be considered a competitor to the belief propagation (BP) algorithm, in that both algorithms can be applied to a wide variety of constraint satisfaction, optimization, and probabilistic inference problems. We show that DC can be interpreted as a message-passing algorithm on a constraint graph, which helps make the comparison with BP more clear. The "difference-map" dynamics of the DC algorithm enables it to
doi:10.1109/tit.2010.2094815
fatcat:ozrfjglht5hedkpqqjzbcub6ta