Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation

DOI10.1007/s00354-008-0069-1zbMath1185.68836OpenAlexW2077659015MaRDI QIDQ2655582

Kenichi Tamura, Masato Inoue, Miho Komiya, Yoshiyuki Kabashima

Publication date: 25 January 2010

Published in: New Generation Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00354-008-0069-1

zbMATH Keywords

low-density parity-check codeserror correcting codebelief propagationBethe free energyBowman-Levin approximation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
• Sequential Minimization of the Bethe Free Energy of Ising Spin Systems
• Good error-correcting codes based on very sparse matrices
• Unnamed Item
• Unnamed Item

This page was built for publication: Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation