Iterative decoding of one-step majority logic decodable codes based on belief propagation

DOI10.1109/26.848552zbMATH Open1010.94016OpenAlexW2099940667MaRDI QIDQ2732997FDOQ2732997

Authors: Rainer Lucas, Marc Fossorier, Yu Kou, Shu Lin 

Publication date: 2 December 2001

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

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

Recommendations

• Bounds on the performance of belief propagation decoding
• On Decoding of Low-Density Parity-Check Codes Over the Binary Erasure Channel
• Iterative decoding of generalized parallel concatenated OSMLD codes
• Iterative decoding of LDPC codes: some bounds and properties
• Improved BP-based decoding algorithms integrated with GA for LDPC codes

zbMATH Keywords

decodingsoft-decision decodingiterative decodingmajority-logic decodingbelief propagation algorithm

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (5)

• Parallel versus sequential updating for belief propagation decoding
• Regular LDPC codes from semipartial geometries
• Title not available (Why is that?)
• Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
• Title not available (Why is that?)

This page was built for publication: Iterative decoding of one-step majority logic decodable codes based on belief propagation

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