Impressive performances by low-density parity-check codes and turbo codes have inspired researchers to determine how their iterative decoders depart from optimal decoding. Iterative decoding can be viewed as the application of the sum-product or min-sum algorithm in a graph that describes the constraints on a system of variables. The authors discuss here how iterative decoding maximizes correlation, and skewness and pseudocodewords in the decoding tree.
No takes yet. Share an insight, caveat, or question.
Frey et al. (2002) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: