The sum-product algorithm on small graphs

MaRDI QIDQ5448213zbMATH OpenFDO

Authors Michael E. O'Sullivan, John Brevik, Rich Wolski

Publication date 20 March 2008

zbMATH Keywords

finite length bipartite graphslow-density parity check codessum-product algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Prefix, length-variable, comma-free codes (94A45) Combinatorial codes (94B25) Other types of codes (94B60)

Recommendations

• Factor graphs and the sum-product algorithm
• Sufficient Conditions for Convergence of the Sum–Product Algorithm
• On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
• scientific article; zbMATH DE number 2064647
• The sum-product algorithm: algebraic independence and computational aspects

Cited in

(2)

• Sufficient Conditions for Convergence of the Sum–Product Algorithm
• The sum-product algorithm: algebraic independence and computational aspects

This page was built for publication: The sum-product algorithm on small graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448213)