Serial Schedules for Belief-Propagation: Analysis of Convergence Time

DOI10.1109/TIT.2007.915702MaRDI QIDQ3604495zbMATH OpenFDO

Authors Jacob Goldberger, Haggai Kfir

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2007.915702

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Decoding (94B35)

Recommendations

• Efficient Serial Message-Passing Schedules for LDPC Decoding
• scientific article; zbMATH DE number 5079406
• Parallel versus sequential updating for belief propagation decoding
• Bounds on the performance of belief propagation decoding
• Iterative decoding of LDPC codes: some bounds and properties

Cited in

(3)

• Parallel versus sequential updating for belief propagation decoding
• Efficient Serial Message-Passing Schedules for LDPC Decoding
• Gauging tensor networks with belief propagation

This page was built for publication: Serial Schedules for Belief-Propagation: Analysis of Convergence Time

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